#include <algorithm>
#include <iostream>
using namespace std;
int main() {
    int n; cin >> n;
    int q[5000][12] = {}, r[5000] = {};
    for (int i = 0; i < (1<<n); i++) {
        for (int j = 0; j < n; j++) cin >> q[i][j];
        cin >> r[i];
    }
    cout << "A=";
    if (*max_element(r, r+(1<<n)) == 0) cout << "⊥\n";
    else if (*min_element(r, r+(1<<n)) == 1) cout << "⊤\n";
    else {
        bool fst = true;
        for (int i = 0; i < (1<<n); i++) {
            if (r[i]) {
                if (fst) fst = false;
                else cout << "∨";
                cout << "(";
                for (int j = 0; j < n; j++) {
                    if (j > 0) cout << "∧";
                    if (!q[i][j]) cout << "¬";
                    cout << "P_" << j+1;
                }
                cout << ")";
            }
        }
    }
    cout << endl;
}