Bit Operations

You are given $N$ pairs $(x_i, y_i)$. Construct a function $f$ that satisfies $y_i = f(x_i)$ for each $i$. The function $f$ must be writable in C in the following form:

uint32_t f(uint32_t x) {
  return Expression;
}

The Expression must satisfy the following BNF:

<expr> ::= "x"
         | <num>
         | "(~" <expr> ")"
         | "(" <expr> <op2> <expr> ")"
<op2> ::= "&" | "|" | "^" | "+" | "-" | "*"

Here, is an unsigned 32-bit integer written in decimal. It must not have leading zeroes, except that zero is written as $0$.

The first line contains an integer $N$ ($1 \le N \le 8$). The next $N$ lines each contain two integers $x_i$ and $y_i$ ($0 \le x_i, y_i < 256$).

Print an expression that satisfies the conditions. The output must strictly follow the BNF format above. Extra whitespace, newlines, parentheses, and other characters are not allowed. The output must contain at most $10^5$ characters. The answer is guaranteed to exist for the given input.