#include<algorithm>
#include<complex>
#include<ctype.h>
#include<iomanip>
#include<iostream>
#include<map>
#include<math.h>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<stdio.h>
#include<string>
#include<string>
#include<vector>

using namespace std;
typedef long long ll;

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("YES")
#define p_no() p("NO")

template < typename T >
void vprint(T &V){
	for(auto v : V){
    	cout << v << " ";
	}
	cout << endl;
}

const ll mod = 1e9 + 7;
const ll inf = 1e18;

string f(vector<ll> list){
    stringstream ss;
    ss << '(';
    ll L = list.size();
    FOR(i, 0, L){
        if(list[i]==0){
            ss << "¬";
        }
        ss << "P_" << i+1;
        if(i!=L-1){
            ss << "∧";
        }
    }

    ss << ')';
    return ss.str();
}

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

    // input
    ll N;
    cin >> N;

    vector<ll> R;
    vector<vector<ll> > A(1<<N);
    FOR(i, 0, 1<<N){
        FOR(j, 0, N){
            ll q;
            cin >> q;
            A[i].push_back(q);
        }

        ll r;
        cin >> r;
        R.push_back(r);
    }

    bool zero_exist = false;
    bool one_exist = false;
    for(auto r : R){
        if(r==0){
            zero_exist = true;
        }else{
            one_exist = true;
        }
    }

    if(zero_exist && !one_exist){
        p("A=⊥");
        return 0;
    }
    else if(!zero_exist && one_exist){
        p("A=⊤");
        return 0;
    }

    stringstream ss;
    ss << "A=";
    ll len = 1<<N;
    vector<string> temp;
    FOR(i, 0, len){
        if(R[i]==1){
            temp.push_back(f(A[i]));
        }
    }
    ss << temp[0];
    FOR(i, 1, temp.size()){
        ss << "∨" << temp[i];
    }

    p(ss.str());
    
    return 0;
}