/* ---------- STL Libraries ---------- */ // IO library #include #include #include #include #include // algorithm library #include #include #include #include #include // container library #include #include #include #include #include #include #include #include #include #include #include /* ---------- Namespace ---------- */ using namespace std; /* ---------- Type ---------- */ using ll = long long; #define int ll #define P pair /* ---------- Constants */ const double PI = 3.141592653589793238462643383279; const ll MOD = 1e9 + 7; const int INF = 1LL << 55; /* v-v-v-v-v-v-v-v-v Main Part v-v-v-v-v-v-v-v-v */ signed main() { int N; cin >> N; int M = 1; for (int i = 0; i < N; i++) M *= 2; int table[M][N]; int R[M]; for (int i = 0; i < M; i++) { for (int j = 0; j < N; j++) { cin >> table[i][j]; } cin >> R[i]; } bool always_true = true; bool always_false = true; for (int i = 0; i < M; i++) { if (R[i] == 1) { always_false = false; } else { always_true = false; } } if (always_false) { cout << "A=⊥" << endl; return 0; } if (always_true) { cout << "A=⊤" << endl; return 0; } string ret = "A="; bool is_first = true; for (int i = 0; i < M; i++) { if (R[i] == 0) continue; if (!is_first) ret += "∨"; ret += "("; bool is_first_in = true; for (int j = 0; j < N; j++) { if (!is_first_in) ret += "∧"; if (table[i][j] == 0) { ret += "¬P_" + to_string(j+1); } else { ret += "P_" + to_string(j+1); } is_first_in = false; } is_first = false; ret += ")"; } cout << ret << endl; return 0; }