#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<unordered_set>
#include<numeric>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(int i = ((int)(b));i>=((int)(a));i--)
typedef long long ll;
typedef pair<ll, ll> mp;
ll mod = 1e9+7;
ll inf = 1e18;

ll n,a[4100][13],r[4100],cnt=0;
string ans="A=";

int main(void){
	cin>>n;
	rep(i,1<<n){
		rep(j,n)cin>>a[i][j];
		cin>>r[i];
	}
	rep(i,1<<n){
		if(r[i]==0)continue;//要らないので
		if(cnt!=0)ans+="∨";
		ans+="(";
		rep(j,n){
			if(j!=0)ans+="∧";
			if(a[i][j]==0){
				ans+="¬P_"+to_string(j+1);
			}else{
				ans+="P_"+to_string(j+1);
			}
		}
		ans+=")";
		cnt++;
	}
	if(cnt==0)ans+="⊥";
	if(cnt==(1<<n))ans="A=⊤";
	cout<<ans<<endl;
	return 0;
}