// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;

#define debug(...) fprintf(stderr, __VA_ARGS__)
#define int long long int
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
typedef pair<int, int> pii;
typedef long long ll;
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1001001001001001LL;
const ll MOD = 1000000007LL;

int board[1 << 12][12], R[1 << 12];
signed main() {
    int N; cin >> N;
    int cntT = 0, cntF = 0;
    for(int i=0; i<(1<<N); i++) {
        for(int j=0; j<N; j++) {
            cin >> board[i][j];
        }
        cin >> R[i];
        if(R[i] == 0) cntF++;
        if(R[i] == 1) cntT++;
    }

    if(cntT == (1 << N)) {
        cout << "A=⊤" << endl;
    }
    else if(cntF == (1 << N)) {
        cout << "A=⊥"<< endl;
    }
    else {
        cout << "A=";
        for(int i=0; i<(1<<N); i++) {
            if(R[i] == 1) {
                cout << "(";
                for(int j=0; j<N; j++) {
                    if(board[i][j] == 0) {
                        cout << "¬P_"<< j+1;
                    }
                    else {
                        cout << "P_" << j+1;
                    }
                    if(j+1 != N) cout << "∧";
                }
                cout << ")";
                if(--cntT) {
                    cout << "∨";
                }
            }
        }
        cout << endl;
    }
    return 0;
}