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.

Input

The first line contains an integer n (1 ≤ n ≤ 5·105) — the number of lines.

Next n lines contain commands. A command consists of a character that represents the operation ("&", "|" or "^" for AND, OR or XOR respectively), and the constant xi 0 ≤ xi ≤ 1023.

Output

Output an integer k (0 ≤ k ≤ 5) — the length of your program.

Next k lines must contain commands in the same format as in the input.

Examples

Input

3
| 3
^ 2
| 1


Output

2
| 3
^ 2


Input

3
&amp; 1
&amp; 3
&amp; 5


Output

1
&amp; 1


Input

3
^ 1
^ 2
^ 3


Output

0

Note

You can read about bitwise operations in <https://en.wikipedia.org/wiki/Bitwise_operation>.

Second sample:

Let x be an input of the Petya's program. It's output is ((x&1)&3)&5 = x&(1&3&5) = x&1. So these two programs always give the same outputs.
NO_CHANGE = -1
SET_1 = 1
SET_0 = 0
SWITCH = 2


def xor_op(bit_op, value):
    for i in range(10):
        if value & (1 << i):
            if NO_CHANGE == bit_op[i]:
                bit_op[i] = SWITCH
            elif SWITCH == bit_op[i]:
                bit_op[i] = NO_CHANGE
            else:
                bit_op[i] = SET_1 - bit_op[i]
    return bit_op


def or_op(bit_op, value):
    for i in range(10):
        if value & (1 << i):
            bit_op[i] = SET_1
    return bit_op


def and_op(bit_op, value):
    for i in range(10):
        if not value & (1 << i):
            bit_op[i] = SET_0
    return bit_op



def and_op_answer(bit_op):
    value = int('1111111111', 2)
    for i in range(10):
        if bit_op[i] == SET_0:
            value ^= 1 << i
    return '' if value == int('1111111111', 2) else "& {}\n".format(value)

def or_op_answer(bit_op):
    value = 0
    for i in range(10):
        if bit_op[i] == SET_1:
            value ^= 1 << i
    return '' if value == 0 else "| {}\n".format(value)

def xor_op_answer(bit_op):
    value = 0
    for i in range(10):
        if bit_op[i] == SWITCH:
            value ^= 1 << i
    return '' if value == 0 else "^ {}\n".format(value)

n = input()

bit_op = [NO_CHANGE] * 10

for i in range(0, n):
    op, value = raw_input().split()
    value = int(value)
    if op == '^':
        bit_op = xor_op(bit_op, value)
    elif op == '|':
        bit_op = or_op(bit_op, value)
    else:
        bit_op = and_op(bit_op, value)

answer = or_op_answer(bit_op) + and_op_answer(bit_op) + xor_op_answer(bit_op)
print "{}\n{}".format(answer.count("\n"), answer)
