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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.PrintStream;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
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 t = in.nextInt();
            int i = 1023;
            int k = 0;
            for (int j = 0; j < t; j++) {
                String s = in.next();
                int temp = in.nextInt();
                if (s.equals("&")) {
                    i &= temp;
                    k &= temp;
                } else if (s.equals("|")) {
                    i |= temp;
                    k |= temp;
                } else {
                    i ^= temp;
                    k ^= temp;
                }
                //System.out.println(k+"--"+temp);
            }
            //System.out.println(i);
            //System.out.println(k +" "+i);
            int or = 0, and = 1023, xor = 0;
            for (int j = 0; j < 10; j++) {
                int t1 = (i & (1 << j));
                int t2 = (k & (1 << j));
                if (t2 == 0) {
                    if (t1 == 0) {
                        and = and & ~(1 << j);
                    }
                } else {
                    if (t1 > 0) {
                        or = or | (1 << j);
                    } else {
                        xor = xor | (1 << j);
                    }
                }
            }
            System.out.println("3");
            System.out.println("& " + and);
            System.out.println("| " + or);
            System.out.println("^ " + xor);
        }

    }
}