Petya learned a new programming language CALPAS. A program in this language always takes one non-negative integer and returns one non-negative integer as well.

In the language, there are only three commands: apply a bitwise operation AND, OR or XOR with a given constant to the current integer. A program can contain an arbitrary sequence of these operations with arbitrary constants from 0 to 1023. When the program is run, all operations are applied (in the given order) to the argument and in the end the result integer is returned.

Petya wrote a program in this language, but it turned out to be too long. Write a program in CALPAS that does the same thing as the Petya's program, and consists of no more than 5 lines. Your program should return the same integer as Petya's program for all arguments from 0 to 1023.
The first line contains an integer *n* (1 ≤ *n* ≤ 5·10<sup class="upper-index">5</sup>) — the number of lines.

Next *n* lines contain commands. A command consists of a character that represents the operation ("&amp;", "|" or "^" for AND, OR or XOR respectively), and the constant *x*<sub class="lower-index">*i*</sub> 0 ≤ *x*<sub class="lower-index">*i*</sub> ≤ 1023.
You can read about bitwise operations in [https://en.wikipedia.org/wiki/Bitwise_operation](https://en.wikipedia.org/wiki/Bitwise_operation).

Second sample:

Let *x* be an input of the Petya's program. It's output is ((*x*&amp;1)&amp;3)&amp;5 = *x*&amp;(1&amp;3&amp;5) = *x*&amp;1. So these two programs always give the same outputs.
3
| 3
^ 2
| 1
2
| 3
^ 2
3
& 1
& 3
& 5
1
& 1
3
^ 1
^ 2
^ 3
0
2
| 999
^ 689
2
| 999
^ 689
3
& 242
^ 506
^ 522
2
| 781
^ 253
2
| 56
^ 875
2
| 56
^ 875
3
^ 125
^ 377
& 1019
2
| 4
^ 260
1
& 123
1
& 123
1
| 123
1
| 123
1
^ 123
1
^ 123
10
^ 218
& 150
| 935
& 61
| 588
& 897
| 411
| 584
^ 800
| 704
2
| 1023
^ 260
10
^ 160
& 1021
& 510
^ 470
& 1022
& 251
& 760
& 1016
| 772
| 515
2
| 775
^ 112
1
& 0
1
& 0
1
| 0
0
1
^ 0
0
1
& 1023
0
1
| 1023
1
| 1023
1
^ 1023
1
^ 1023
from sys import stdout
from sys import stdin
def get():
    return stdin.readline().strip()
def getf(sp = " "):
    return [int(i) for i in get().split(sp)]
def put(a, end = "\n"):
    stdout.write(str(a) + end)
def putf(a, sep = " ", end = "\n"):
    stdout.write(sep.join([str(i) for i in a]) + end)
     
#from collections import defaultdict as dd, deque
#from random import randint, shuffle
#from functools import cmp_to_key, reduce
#from math import factorial as fac, acos, asin, atan2, gcd, log, e
#from bisect import bisect_right as br, bisect_left as bl, insort

class bitset:
    def __init__(self, sz, n = 0):
        self.bs = [0] * sz
        self.sz = sz
        x = sz - 1
        while(n > 0):
            self.bs[x] = n % 2
            x -= 1
            n //= 2
    def __xor__(self, other):
        ret = bitset(self.sz, 0)
        for i in range(self.sz):
            ret.bs[i] = self.bs[i] ^ other.bs[i]
        return ret
    def __and__(self, other):
        ret = bitset(self.sz, 0)
        for i in range(self.sz):
            ret.bs[i] = self.bs[i] & other.bs[i]
        return ret
    def __or__(self, other):
        ret = bitset(self.sz, 0)
        for i in range(self.sz):
            ret.bs[i] = self.bs[i] | other.bs[i]
        return ret
    def __getitem__(self, x):
        return self.bs[x]

def main():
    n = int(get())
    a = bitset(10, 0)
    b = bitset(10, 1023)
    for i in range(n):
        t, k = get().split()
        k = bitset(10, int(k))
        if(t == "^"):
            a = a ^ k
            b = b ^ k
        if(t == "|"):
            a = a | k
            b = b | k
        if(t == "&"):
            a = a & k
            b = b & k
    d = [0, 0, 1023]
    for i in range(10):
        if(a[i] == 0 and b[i] == 1):
            pass
        if(a[i] == 1 and b[i] == 0):
            d[0] += pow(2, 9 - i)
        if(a[i] == 1 and b[i] == 1):
            d[1] += pow(2, 9 - i)
        if(a[i] == 0 and b[i] == 0):
            d[2] -= pow(2, 9 - i)
    put(3)
    put("& %d" % d[2])
    put("^ %d" % d[0])
    put("| %d" % d[1])
main()