#include<bits/stdc++.h>
using namespace std;

#define lint long long
#define P pair<int, int>
#define LLP pair<long long, long long>
#define REP(i, x, n) for(int i = (x), i##_len = (int)(n) ; i < i##_len ; ++i)
#define rep(i, n) for(int i = 0, i##_len = (int)(n) ; i < i##_len ; ++i)
#define repr(i, n) for(int i = (int)(n) - 1 ; i >= 0 ; --i)
#define SORT(x) sort((x).begin(), (x).end())
#define SORT_INV(x) sort((x).rbegin(), (x).rend())

const int IINF = 1e9 + 100;
const long long LLINF = 2e18 + 129;
const long long MOD = 1e9 + 7;
const int dx4[] = {1, 0, -1, 0}, dy4[] = {0, 1, 0, -1};
const int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};
const double EPS = 1e-8;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n;
    cin >> n;

    int p2 = pow(2, n);

    vector< vector<int> > p(p2, vector<int>(n));
    vector<int> r(p2);
    bool flag1 = true, flag2 = true;
    rep(i, p2){
        rep(j, n){
            cin >> p[i][j];
        }
        cin >> r[i];
        flag1 &= (r[i] == 1);
        flag2 &= (r[i] == 0);
    }

    cout << "A=";
    if(flag1){
        cout << "⊤" << endl;
    }else if(flag2){
        cout << "⊥" << endl;
    }else{
        int cnt = 0;
        rep(i, p2){
            if(r[i] == 0){
                continue;
            }
            if(cnt > 0){
                cout << "∨";
            }
            ++cnt;
            cout << "(";
            rep(j, n){
                if(p[i][j] == 0){
                    cout << "¬";
                }
                cout << "P_" << j + 1;
                if(j < n - 1){
                    cout << "∧";
                }
            }
            cout << ")";
        }
        cout << endl;
    }

    return 0;
}