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.util.*;
import java.io.*;
import java.text.*;
public class t{
    static final long mod = (long)1e8, root = 23;
    static long IINF = (long)1e18+1;
    static int MAX = (int)1e6+1, B = 10;
    static FastReader in;
    
    public static void main(String[] args) throws Exception{
        in = new FastReader();
        int n = ni();
        int[][] op = new int[n][2];
        for(int i = n-1; i>= 0; i--){
            op[i][0] = n().charAt(0);
            op[i][1] = ni();
        }
        int[] ans = new int[B];
        Arrays.fill(ans, -1);
        BitSet flip = new BitSet(B);
        for(int i = 0; i< n; i++){
            if(op[i][0] == '^'){
                for(int j = 0; j<B; j++)if(ans[j] == -1 && ((op[i][1]>>j)&1)==1)flip.flip(j);
            }else if(op[i][0] == '|'){
                for(int j = 0; j< B; j++)
                    if(ans[j] == -1 && ((op[i][1]>>j)&1)==1)
                        ans[j] = (flip.get(j))?0:1;
            }else if(op[i][0] == '&'){
                for(int j = 0; j< B; j++){
                    if(ans[j] == -1 && ((op[i][1]>>j)&1)==0){
                        ans[j] = (flip.get(j))?1:0;
                    }
                }
            }
        }
        int and = 1023, or = 0, xor = 0;
        for(int i = 0; i< B; i++){
            if(ans[i] == -1){
                if(flip.get(i))xor|=1<<i;
            }else if(ans[i] == 0){
                and ^= (1<<i);
            }else or |= (1<<i);
        }
        int k = 0;
        StringBuilder out = new StringBuilder("");
        if(and!=1023){
            out.append("& "+and+"\n");
            k++;
        }
        if(or != 0){
            out.append("| "+or+"\n");
            k++;
        }
        if(xor != 0){
            out.append("^ "+xor+"\n");
            k++;
        }
        p(k+"\n"+out.toString());
    }
    
    static int[] ia(int n){
        int[] out = new int[n];
        for(int i = 0; i< n; i++)out[i] = ni();
        return out;
    }
    
    static long gcd(long a, long b){
        return (b==0)?a:gcd(b,a%b);
    }
    
    static void p(Object o){
        System.out.print(o);
    }
    
    static void pn(Object o){
        System.out.println(o);
    }
    
    static String n(){
        return in.next();
    }
    
    static String nln(){
        return in.nextLine();
    }
    
    static int ni(){
        return Integer.parseInt(in.next());
    }
    
    static long nl(){
            return Long.parseLong(in.next());
    }
    
    static double nd(){
        return Double.parseDouble(in.next());
    }
    
    static class FastReader{
        BufferedReader br;
        StringTokenizer st;
        public FastReader(){
            br = new BufferedReader(new InputStreamReader(System.in));
        }
        
        public FastReader(String s) throws Exception{
            br = new BufferedReader(new FileReader(s));
        }
 
        String next(){
            while (st == null || !st.hasMoreElements()){
                try{
                    st = new StringTokenizer(br.readLine());
                }catch (IOException  e){
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
 
        String nextLine(){
            String str = "";
            try{
                str = br.readLine();
            }catch (IOException e){
                e.printStackTrace();
            }
            return str;
        }
    }
}