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.
import static java.util.Arrays.*;
import static java.lang.Math.*;
import static java.math.BigInteger.*;
import java.util.*;
import java.math.*;
import java.io.*;

public class Main implements Runnable {
    
    void solve() throws IOException {
    	int[][] a = new int[2][10];
    	fill(a[1], 1);
    	int n = nextInt();
    	for (int i = 0; i < n; i++) {
    		char c = next().charAt(0);
    		int v = nextInt();
    		for (int j = 0; j < 2; j++)
    			for (int k = 0; k < 10; k++) 
    				if (c == '|') a[j][k] |=  v >> k & 1;
    				else if (c == '&') a[j][k] &= v >> k & 1;
    				else if (c == '^') a[j][k] ^= v >> k & 1;
    	}
    	debug(a);
    	int and = 0, or = 0, xor = 0;
    	for (int i = 0; i < 10; i++) {
    		outer: for (int x = 0; x < 2; x++)
    			for (int y = 0; y < 2; y++)
    				for (int z = 0; z < 2; z++) {
    					boolean can = true;
    					for (int j = 0; j < 2; j++)
    						if ((((j & x) | y) ^ z) != a[j][i]) can = false;
    					if (can) {
    						and |= x << i;
    						or |= y << i;
    						xor |= z << i;
    						break outer;
    					}
    				}
    	}
    	out.println(3);
    	out.println("& " + and);
    	out.println("| " + or);
    	out.println("^ " + xor);
    }
    
    String next() throws IOException {
        while(st == null || !st.hasMoreTokens()) st = new StringTokenizer(input.readLine());
        return st.nextToken();
    }
    
    int nextInt() throws IOException {
        return Integer.parseInt(next());
    }
    
    long nextLong() throws IOException {
        return Long.parseLong(next());
    }
    
    double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }
    
    void debug(Object... o) {
        if (TEST) System.out.println(deepToString(o));
    }
    
    void gcj(Object o) {
        String s = String.valueOf(o);
        out.println("Case #" + test + ": " + s);
        System.out.println("Case #" + test + ": " + s);
    }
    
    BufferedReader input;
    PrintWriter out;
    StringTokenizer st;
    int test;
    boolean TEST = System.getProperty("ONLINE_JUDGE") == null;

    void init() throws IOException {
        if (TEST) input = new BufferedReader(new FileReader("input.in")); 
        else input = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(new BufferedOutputStream(System.out));
    }
    
    public static void main(String[] args) throws IOException {
        new Thread(null, new Main(), "", 1 << 20).start();
    }
    
    public void run() {
        try {
            init();
            if (TEST) {
                int runs = nextInt();
                for(int i = 0; i < runs; i++) solve();
            } else solve();
            out.close();        
        } catch (Exception e) {
            e.printStackTrace();
            System.exit(1);
        }
    }
}