#include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define repeat(i,s,n) for(int (i)=s; (i)<(n); (i)++)
#define revrep(i,n) for(int (i)=(n)-1;i>=0; i--)

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout<<setprecision(std::numeric_limits<float>::max_digits10);
  int n;
  cin>>n;
  vector<vector<int>> Q(1<<n);
  vector<int> R(1<<n);
  rep(i,1<<n) {
    int q;
    rep(j,n) {
      cin>>q;
      Q[i].push_back(q);
    }
    int r;
    cin>>r;
    R[i]=r;
  }
  rep(i,1<<n) {
    if(R[i]!=1)
      goto L1;
  }
  cout << "A=⊤" << endl;
  return 0;
L1:
  rep(i,1<<n) {
    if(R[i]!=0)
      goto L2;
  }
  cout << "A=⊥"<<endl;
  return 0;
L2:
  stringstream ss;
  ss<<"A=";
  int qcnt=0;
  rep(i,1<<n) {
    if(R[i]==1) {
      if(qcnt!=0) {
        ss<<"∨";
      }
      ss<<"(";
      int cnt=0;
      rep(j,n) {
        if(Q[i][j]==1) {
          if(cnt!=0)
            ss<<"∧";
          ss<<"P_"<<j+1;
          cnt++;
        } else {
          if(cnt!=0)
            ss<<"∧";
          ss<<"¬P_"<<j+1;
          cnt++;
        }
      }
      ss<<")";
      qcnt++;
    }
  }
  cout << ss.str() << endl;
  return 0;
}