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

public class C {

	public static void main(String[] args) throws IOException {
		Scanner sc=new Scanner(System.in);
		PrintWriter pw=new PrintWriter(System.out);
		int n=sc.nextInt();
		int  []bits=new int [11];
		Arrays.fill(bits, -1);
		
		ArrayList<Integer> values=new ArrayList();
		int last=0;
		int value=0;
		int x=6;
		while(n-->0)
		{
			char op=sc.next().charAt(0);
			int v=sc.nextInt();
			if(op=='|')
			{
				for(int i=0;i<11;i++)
				{
					if((v&1<<i)!=0)
						bits[i]=1;
				}
				x|=v;
			}
			else if(op=='&')
			{
				for(int i=0;i<11;i++)
				if((v&1<<i)==0)
					bits[i]=0;
				x&=v;
			}
			else
			{
				for(int i=0;i<11;i++)
					if((v&1<<i)!=0)
					{
						if(bits[i]==0)
							bits[i]=1;
						else if (bits[i]==1)
							bits[i]=0;
						else bits[i]--;
					}
				last=n;
				value=v;
				x^=v;
			}
			
		}
		int ans=0;
		
			
		int []pow=new int [11];pow[0]=1;
		for(int i=1;i<11;i++)
			pow[i]=2*pow[i-1];
		int XOR=0;
		int And=1023;
		for(int i=0;i<10;i++)
		{	
			if(bits[i]==1)
				ans+=pow[i];
			else if(bits[i]<0)
			{
				int s=-bits[i];
				if(s%2==0)
					XOR+=pow[i];
			}
			else if(bits[i]==0)
			{
				And-=pow[i];
			}
				
		}	
		
		
		
		{
			pw.println(3);
			pw.printf("& %d\n",And);
			pw.printf("| %d\n",ans);
			pw.printf("^ %d\n",XOR);
		}
		
		pw.close();
	}
	
	
	
}
class Scanner 
{
	StringTokenizer st;
	BufferedReader br;

	public Scanner(InputStream s){	br = new BufferedReader(new InputStreamReader(s));}

	public String next() throws IOException 
	{
		while (st == null || !st.hasMoreTokens()) 
			st = new StringTokenizer(br.readLine());
		return st.nextToken();
	}

	public int nextInt() throws IOException {return Integer.parseInt(next());}
	
	public long nextLong() throws IOException {return Long.parseLong(next());}

	public String nextLine() throws IOException {return br.readLine();}
	
	public double nextDouble() throws IOException
	{
		String x = next();
		StringBuilder sb = new StringBuilder("0");
		double res = 0, f = 1;
		boolean dec = false, neg = false;
		int start = 0;
		if(x.charAt(0) == '-')
		{
			neg = true;
			start++;
		}
		for(int i = start; i < x.length(); i++)
			if(x.charAt(i) == '.')
			{
				res = Long.parseLong(sb.toString());
				sb = new StringBuilder("0");
				dec = true;
			}
			else
			{
				sb.append(x.charAt(i));
				if(dec)
					f *= 10;
			}
		res += Long.parseLong(sb.toString()) / f;
		return res * (neg?-1:1);
	}
	
	public boolean ready() throws IOException {return br.ready();}


}