#include using namespace std; #define ALL(obj) (obj).begin(), (obj).end() #define REP(i, n) for(int i = 0;i < (n);++i) #define REPLL(i, n) for(ll i = 0;i < (n);++i) #define endl "\n" #define pb push_back #define MOD 1000000007LL #define PI 3.1415926 typedef long long ll; template inline T GCD(T a,T b){T c;while(b!=0){c=a%b;a=b;b=c;}return a;} template inline T LCM(T a,T b){T c=GCD(a,b);a/=c;return a*b;} template inline T nCr(T a,T b){T i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;} template inline T nHr(T a,T b){return nCr(a+b-1,b);} template inline T POW(T a,T b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;} int main(void){ cin.tie(0); ios::sync_with_stdio(false); int n; bool q[144][12], r[144]; int trues = 0; cin >> n; REP(i, n*n){ REP(j, n) cin >> q[i][j]; cin >> r[i]; if(r[i]) trues++; } cout << "A="; if(trues == 0){ cout << "⊥" << endl; } else if(trues == n*n){ cout << "⊤" << endl; } else { string ans = ""; REP(i, n*n){ if(r[i]){ ans += '('; REP(j, n){ if(!q[i][j]) ans += "¬"; ans += "P_" + to_string(j+1); if(j!=n-1) ans += "∧"; } ans += ")∨"; } } REP(i, ans.size()-3) cout << ans[i]; cout << endl; } return 0; }