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

public class C {

	
	public static void main(String[] args) {
		FastScanner in = new FastScanner();
		int max = 1023;
		int n = in.nextInt();
		int bits[] = new int[10];
		boolean flipped[] = new boolean[10];
		Arrays.fill(bits, -1);
		for(int i = 0; i < n; i++)
		{
			char op = in.next().charAt(0);
			int num = in.nextInt();
			if(op == '|')
			{
				for(int j = 0; j < 10; j++)
				{
					if( (num & (1 << j)) != 0)//If the bit is on
					{
						bits[j] = 1;
					}
				}
			}
			else if(op == '&')
			{
				for(int j =0 ; j < 10; j++)
				{
					if( (num & (1<<j)) == 0)	//If the bit is off
					{
						bits[j] = 0;
					}
				}
			}
			else
			{
				for(int j = 0; j < 10; j++)
				{
					if( (num & (1<<j)) != 0)	//If the bit is on
					{
						if(bits[j] == 0) bits[j] = 1;
						else if(bits[j] == 1) bits[j] = 0;
						else flipped[j] = !flipped[j];
					}
				}
				
			}
			
		}
		
		//for(int i = 0; i < 5; i++)
		//	System.out.print(bits[i]+" ");
		//System.out.println();
		//for(int i = 0; i < 5; i++)
	//		System.out.print(flipped[i] ? "T " : "F ");
	//	System.out.println();
		
		int onBits =0;
		int offBits = 0;
		for(int i = 0; i < 10; i++)
		{
			if(bits[i] == 1) onBits++;
			else if(bits[i] == 0) offBits++;
		}

		
		//First do an OR with everything we need to change except flipped
		int or = 0;
		for(int i =0 ; i < 10; i++)
		{
			if(bits[i] == 0 ||bits[i] == 1)
				{
				or += (1 << i);
				//System.out.println("or: "+i);
				}
		}
		
		//Next do an x-or with what we need to flip
		int xor = 0;
		for(int i =0 ; i < 10; i++)
		{
			if(bits[i] == -1 && flipped[i] == true)
				{
				xor += (1 << i);
				//System.out.println("xor: "+i);

				}
		}
		
		//Now put the zeros in
		int zero = 0;
		for(int i = 0; i < 10; i++)
		{
			if(bits[i] == 0) continue;
			else {
				zero += (1 << i);
				//System.out.println("and: "+i);

			}
		}
		
		//if(onBits == 0 && offBits == 0) System.out.println(0);
		//else
		//{
			System.out.println(3);
			System.out.println("| "+or+"\n^ "+xor+"\n& "+zero);
		//}
	
		
		
		

		
		
		
	}

	
	
	public static class FastScanner
	{
		BufferedReader br;
		StringTokenizer st;

		public FastScanner(String s)
		{
			try {
				br = new BufferedReader(new FileReader(s));
			} catch (FileNotFoundException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
		}

		public FastScanner()
		{
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String nextToken()
		{
			while (st == null || !st.hasMoreElements())
			{
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					// TODO Auto-generated catch block
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		int nextInt()
		{
			return Integer.parseInt(nextToken());
		}

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

		double nextDouble()
		{
			return Double.parseDouble(nextToken());
		}
		
		String next()
		{
			return nextToken();
		}
	}

}
