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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

/**
 * @author Don Li
 */
public class ShortProgram {
    void solve() {
        int n = in.nextInt();
        
        int[] and = new int[10], or = new int[10], xor = new int[10];
        Arrays.fill(and, 1);
        for (int i = 0; i < n; i++) {
            char op = in.nextToken().charAt(0);
            int x = in.nextInt();
            for (int j = 0; j < 10; j++) {
                if ((x & 1 << j) > 0) {
                    if (op == '&') {
                        continue;
                    } else if (op == '|') {
                        and[j] = 1;
                        or[j] = 1;
                        xor[j] = 0;
                    } else {
                        xor[j] ^= 1;
                    }
                } else {
                    if (op == '&') {
                        and[j] = 0;
                        or[j] = 0;
                        xor[j] = 0;
                    } else if (op == '|') {
                        continue;
                    } else {
                        continue;
                    }
                }
            }
        }
        
        out.println(3);
        int[] res = new int[3];
        for (int i = 0; i < 10; i++) {
            if (and[i] == 1) res[0] |= 1 << i;
            if (or[i] == 1) res[1] |= 1 << i;
            if (xor[i] == 1) res[2] |= 1 << i;
        }
        out.printf("& %d%n", res[0]);
        out.printf("| %d%n", res[1]);
        out.printf("^ %d%n", res[2]);
        
    }
    
    public static void main(String[] args) {
        in = new FastScanner(new BufferedReader(new InputStreamReader(System.in)));
        out = new PrintWriter(System.out);
        new ShortProgram().solve();
        out.close();
    }
    
    static FastScanner in;
    static PrintWriter out;
    
    static class FastScanner {
        BufferedReader in;
        StringTokenizer st;
        
        public FastScanner(BufferedReader in) {
            this.in = in;
        }
        
        public String nextToken() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(in.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
        
        public int nextInt() {
            return Integer.parseInt(nextToken());
        }
        
        public long nextLong() {
            return Long.parseLong(nextToken());
        }
        
        public double nextDouble() {
            return Double.parseDouble(nextToken());
        }
    }
}