#include <bits/stdc++.h>
#define ll unsigned long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MOD (ll)(1000000000 + 7)
using namespace std;
int main()
{
    ll n;
    cin >> n;
    pair<ll, bool> p[(int)powl(2, n)];
    bool T = true, F = true;
    rep(i, powl(2, n))
    {
        ll key = 0ll;
        rep(j, n)
        {
            ll t;
            cin >> t;
            key += t << j;
        }
        ll t;
        cin >> t;
        p[i].first = key;
        p[i].second = t;
        if (t == 1)
            F = false;
        else
            T = false;
    }
    if (T)
    {
        cout << "A=⊤" << endl;
        return 0;
    }
    if (F)
    {
        cout << "A=⊥" << endl;
        return 0;
    }

    cout << "A=";
    rep(i, powl(2, n))
    {
        ll I = p[i].first;
        cout << "(";
        rep(j, n)
        {
            if (((I >> j) & 1) ^ p[i].second == 0)
            {
                cout << "P_" << (j + 1);
            }
            else
            {
                cout << "¬P_" << (j + 1);
            }
            if (j != n - 1)
                cout << "∧";
        }
        cout << ")";
        if (i != powl(2, n) - 1)
            cout << "∨";
    }
    cout << endl;
    return 0;
}