import algorithm, future, hashes, macros, math, sequtils, sets, strutils, tables, unicode

template readString: string = stdin.readLine
template readStrings: seq[string] = stdin.readLine.split
template readInt: int = stdin.readLine.parseInt
template readInts: seq[int] = readLine(stdin).split(" ").map(parseInt)
template readFloat: float = stdin.readLine.parseFloat
template readFloats: seq[float] = stdin.readLine.split.map(parseFloat)
template times(n: int, body: untyped): untyped = (for _ in 0..<n: body)
proc newSeq2[T](n1, n2: Natural): seq[seq[T]] = newSeqWith(n1, newSeq[T](n2))
proc newSeq3[T](n1, n2, n3: Natural): seq[seq[seq[T]]] = newSeqWith(n1, newSeqWith(n2, newSeq[T](n3)))

macro unpack*(rhs: seq, cnt: static[int]): auto =
  let t = genSym(); result = quote do:(let `t` = `rhs`;())
  for i in 0..<cnt: result[0][1].add(quote do:`t`[`i`])

# -------------------------------------------------- #

var N = readInt
var res = "A="
var cnt = 0
for i in 1..(2 ^ N):
  var QR = @[0] & readInts
  if QR[N + 1] == 1:
    cnt += 1
    res.add("(")
    for j in 1..<N:
      if QR[j] == 0:
        res.add("¬")
      res.add("P_")
      res.add(j.intToStr(1))
      res.add("∧")
    if QR[N] == 0:
      res.add("¬")
    res.add("P_")
    res.add(N.intToStr(1))
    res.add(")∨")

if cnt == 2 ^ N:
  res = "A=⊤"
  echo res
  quit()
if cnt == 0:
  res = "A=⊥"
  echo res
  quit()

res.delete(res.len - 3, res.len - 1)
echo res