#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#include <string_view>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int main(){
  int N; cin >> N;
  vector<vector<int>> Q(1<<N,vector<int>(N));
  vector<int> R(1<<N);
  rep(i,1<<N){
    rep(j,N) cin >> Q[i][j];
    cin >> R[i];
  }
  if(*max_element(all(R))==0) cout << "A=⊥" << endl;
  else if(*min_element(all(R))==1) cout << "A=⊤" << endl;
  else{
    vector<string> V;
    cout << "A=";
    rep(i,1<<N){
      if(R[i]==0) continue;
      string s="";
      rep(j,N){
        if(j) s+="∧";
        if(Q[i][j]==0) s+="¬";
        s+="P_"+to_string(j+1);
      }
      V.pb("("+s+")");
    }
    rep(i,sz(V)){
      if(i) cout << "∨";
      cout << V[i];
    }
    cout << endl;
  }
  return 0;
}