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
def to_bin(x):
    bn = [int(y) for y in bin(x)[2:]]
    rn = [0 for x in range(10 - len(bn))]
    return rn + bn


class CodeforcesTask878ASolution:
    def __init__(self):
        self.result = ''
        self.lines_count = 0
        self.program = []

    def read_input(self):
        self.lines_count = int(input())
        for x in range(self.lines_count):
            line = input().split(" ")
            self.program.append([line[0], to_bin(int(line[1]))])

    def process_task(self):
        print(self.program)
        operations_flow = [[0 for x in range(10)] for y in range(self.lines_count)]
        for x in range(self.lines_count):
            for y in range(10):
                if self.program[x][0] == "&":
                    if self.program[x][1][y]:
                        operations_flow[x][y] = 0
                    else:
                        operations_flow[x][y] = 2
                elif self.program[x][0] == "|":
                    if self.program[x][1][y]:
                        operations_flow[x][y] = 3
                    else:
                        operations_flow[x][y] = 0
                else:
                    if self.program[x][1][y]:
                        operations_flow[x][y] = 1
                    else:
                        operations_flow[x][y] = 0
        results = []
        for y in range(10):
            result = 0
            for x in range(self.lines_count):
                if operations_flow[x][y] == 1:
                    if result == 1:
                        result = 0
                    elif result == 2:
                        result = 3
                    elif result == 3:
                        result = 2
                    else:
                        result = 1
                elif operations_flow[x][y] == 2:
                    result = 2
                elif operations_flow[x][y] == 3:
                    result = 3
            results.append(result)
        operations = []
        if 1 in results:
            num = [1 if x == 1 else 0 for x in results]
            coef = int("".join([str(x) for x in num]), 2)
            xor = ["^", coef]
            operations.append(xor)
        if 2 in results:
            num = [0 if x == 2 else 1 for x in results]
            coef = int("".join([str(x) for x in num]), 2)
            annnd = ["&", coef]
            operations.append(annnd)
        if 3 in results:
            num = [1 if x == 3 else 0 for x in results]
            coef = int("".join([str(x) for x in num]), 2)
            orrr = ["|", coef]
            operations.append(orrr)


        #for op in operations_flow:
        #    print(op)
        #print(results)
        #print(operations)
        self.result = "{0}\n".format(len(operations))
        for op in operations:
            self.result += "{0} {1}\n".format(op[0], op[1])

    def get_result(self):
        return self.result


if __name__ == "__main__":
    Solution = CodeforcesTask878ASolution()
    Solution.read_input()
    Solution.process_task()
    print(Solution.get_result())
