Problem: 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.

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;

/**
 * @author genrie
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();

            int[] bits = new int[15];
            int[] xx = new int[15];
            Arrays.fill(bits, -1);

            for (int i = 0; i < n; ++i) {
                char op = in.next().charAt(0);
                int val = in.nextInt();

                if (op == '&') {
                    for (int j = 0; j < 10; ++j) {
                        if (((1 << j) & val) == 0)
                            bits[j] = 0;
                    }
                } else if (op == '|') {
                    for (int j = 0; j < 10; ++j) {
                        if (((1 << j) & val) != 0)
                            bits[j] = 1;
                    }
                } else {
                    for (int j = 0; j < 10; ++j) {
                        if (bits[j] >= 0) {
                            int set = ((1 << j) & val) != 0 ? 1 : 0;
                            bits[j] = (bits[j] != set) ? 1 : 0;
                        } else if (((1 << j) & val) != 0) {
                            ++xx[j];
                            xx[j] = xx[j] & 1;
                        }
                    }
                }
            }


            int or = 0;
            int xor = 0;
            int and = 0;


            for (int i = 0; i < 10; ++i) {
                if (bits[i] < 0) {
                    and |= (1 << i);
                    if (xx[i] == 1) {
                        xor |= (1 << i);
                    }
                }

                if (bits[i] == 1) {
                    or |= (1 << i);
                }
            }

            out.println(3);
            out.println("& " + and);
            out.println("| " + or);
            out.println("^ " + xor);
        }

    }
}