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.Arrays;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Swatantra
 */
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);
        TaskA solver = new TaskA();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskA {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = Integer.parseInt(in.nextLine());

            int res[] = new int[32];
            Arrays.fill(res, 2);
            int i;
            while (n > 0) {
                String t = in.nextLine();
                //System.out.println("val="+t);
                String vals[] = t.split(" ");
                int num = Integer.parseInt(vals[1]);
                for (i = 0; i <= 21; i++) {
                    int val = num & (1 << i);
                    boolean isone = val != 0 ? true : false;
                    if (vals[0].equals("&") && !isone) {
                        res[i] = 0;
                    } else if (vals[0].equals("|") && isone) {
                        res[i] = 1;
                    } else if (vals[0].equals("^") && isone && res[i] == 2) {
                        res[i] = 3;
                    } else if (vals[0].equals("^") && isone && res[i] == 3) {
                        res[i] = 2;
                    } else if (vals[0].equals("^") && isone && res[i] == 1) {
                        res[i] = 0;
                    } else if (vals[0].equals("^") && isone && res[i] == 0) {
                        res[i] = 1;
                    }

                }

                n--;
            }

            // for (i=0;i<=21;i++)
            {
                // System.out.print("i="+res[i]);
            }

            int and = 0, af = 0;
            int or = 0, of = 0;
            int xor = 0, xf = 0;
            for (i = 0; i <= 21; i++) {
                if (res[i] == 0) {
                    af = 1;
                    //and=and & ~(1<<i);
                } else if (res[i] == 1) {
                    of = 1;
                    or = or | (1 << i);

                } else if (res[i] == 3) {
                    xf = 1;
                    xor = xor | (1 << i);
                }
            }
            int count = 0;
            if (af == 1) {
                count++;
                for (i = 0; i <= 9; i++) {
                    if (res[i] != 0) {
                        and = and | (1 << i);
                    }
                }
            }
            if (of == 1)
                count++;
            if (xf == 1)
                count++;
            System.out.println(count);
            if (af == 1) {
                System.out.println("& " + and);
            }
            if (of == 1) {
                System.out.println("| " + or);
            }
            if (xf == 1) {
                System.out.println("^ " + xor);
            }


        }

    }
}