import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
import std.array;
import std.math : pow;
import std.uni : isWhite;
import std.range;

void main()
{
    auto immutable N = readln().chomp().to!float;
    auto max = pow(2.0, N).to!int;
    int[][] input = [];
    for (int i = 0; i < max; i++)
    {
        input ~= readln().chomp().split!isWhite
            .map!(x => x.to!int)
            .array;
    }
    writeln(solve(max, input));
}

string solve(int max, int[][] ps)
{
    int t_count = 0;
    string[] results = [];
    foreach (prow; ps)
    {
        if (prow[$ - 1] == 1)
        {
            t_count++;
            string[] local = [];
            for (int i = 0; i < prow.length - 1; i++)
            {
                if (prow[i] == 1)
                {
                    local ~= "P_" ~ (i + 1).to!string;
                }
                else
                {
                    local ~= "¬P_" ~ (i + 1).to!string;
                }
            }

            results ~= local.join("∧");
        }
    }

    if (t_count == 0)
    {
        return "A=⊥";
    }
    else if (t_count == max)
    {
        return "A=⊤";
    }

    return "A=(" ~ results.join(")∨(") ~ ")";
}