// includes
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())

using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;

// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
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 (a > b) {
    a = b;
    return 1;
  }
  return 0;
}

bool q[5000][13];
bool r[5000];

int main(int argc, char const *argv[]) {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  bool a0 = true, a1 = true;
  rep(i, (1 << n)) {
    rep(j, n) cin >> q[i][j];
    cin >> r[i];
    if (r[i]) a0 = false;
    if (!r[i]) a1 = false;
  }
  cout << "A=";
  if (a0) {
    cout << "⊥" << endl;
    return 0;
  }
  if (a1) {
    cout << "⊤" << endl;
    return 0;
  }
  bool ok = false;
  for (int i = 0; i < (1 << n); i++) {
    if (r[i]) {
      if (ok) cout << "∨";
      ok = true;
      cout << "(";
      for (int j = 0; j < n; j++) {
        if (j != 0) cout << "∧";
        if (!q[i][j]) cout << "¬";
        cout << "P_" << to_string(j + 1);
      }
      cout << ")";
    }
  }
  cout << endl;
  return 0;
}