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.*;
import java.util.*;
import java.math.*;
import java.util.concurrent.*;

public final class xb
{
    static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
	static FastScanner sc=new FastScanner(br);
    static PrintWriter out=new PrintWriter(System.out);
	static Random rnd=new Random();
	static char[] val=new char[]{'&','|','^'};
	
	static int go(int curr,char ch,int val,int bit)
	{
		int now=((1<<bit)&val)>0?1:0;
		
		if(ch=='^')
		{
			return (curr^now);
		}
		
		else if(ch=='&')
		{
			return (curr&now);
		}
		
		else 
		{
			return (curr|now);
		}
	}
	
    public static void main(String args[]) throws Exception
    {
		int n=sc.nextInt();
		
		char[] a=new char[n];int[] op=new int[n];
		
		for(int i=0;i<n;i++)
		{
			a[i]=sc.next().charAt(0);op[i]=sc.nextInt();
		}
		
		int[][] res=new int[2][10];
		
		for(int i=0;i<10;i++)
		{
			for(int k=0;k<2;k++)
			{
				int curr=k;
				
				for(int j=0;j<n;j++)
				{
					curr=go(curr,a[j],op[j],i);
				}
				
				res[k][i]=curr;
			}
		}
		
		int[] ans=new int[3];ans[0]=1023;
		
		for(int i=0;i<10;i++)
		{
			if(res[0][i]==0 && res[1][i]==0)
			{
				ans[0]=(ans[0]^(1<<i));
			}
			
			else if(res[0][i]==0 && res[1][i]==1)
			{
				continue;
			}
			
			else if(res[0][i]==1 && res[1][i]==0)
			{
				ans[2]^=(1<<i);
			}
			
			else
			{
				ans[1]^=(1<<i);
			}
		}
		
		out.println(3);
		
		for(int i=0;i<3;i++)
		{
			out.println(val[i]+" "+ans[i]);
		}
		
		out.close();
    }
}
class FastScanner
{
    BufferedReader in;
    StringTokenizer st;

    public FastScanner(BufferedReader in) {
        this.in = in;
    }
	
    public String nextToken() throws Exception {
        while (st == null || !st.hasMoreTokens()) {
            st = new StringTokenizer(in.readLine());
        }
        return st.nextToken();
    }
	
	public String next() throws Exception {
		return nextToken().toString();
	}
	
    public int nextInt() throws Exception {
        return Integer.parseInt(nextToken());
    }

    public long nextLong() throws Exception {
        return Long.parseLong(nextToken());
    }

    public double nextDouble() throws Exception {
        return Double.parseDouble(nextToken());
    }
}