#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int n;
    cin >> n;

    int q[(1<<n)][n];
    int r[(1<<n)];
    int cnt = 0;
    rep(i,(1<<n)){
        rep(j,n)cin >> q[i][j];
        cin >> r[i];
        cnt += r[i];
    }

    if(cnt == 0){
        cout << "A=⊥" << endl;
        return 0;
    }
    if(cnt == (1 << n)){
        cout << "A=⊤" << endl;
        return 0;
    }

    cout << "A=";

    rep(i,(1<<n)){
        if(r[i]){
            cout << '(';
            rep(j,n){
                if(q[i][j] == 0)cout << '¬';
                cout << "P_";
                cout << j + 1;
                if(j < n - 1)cout << '∧';
            }
            cout << ')';
            cnt--;
            if(cnt>0)cout << '∨';
        }
    }
    cout << endl;
    
    return 0;
}