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.*;

public class Main {
	
	static String appendZeroes(String str) {
		String temp = "0000000000";
		return (temp.substring(str.length()) + str);
	}
	
	static class FastReader{
		BufferedReader br;
		StringTokenizer st;
		
		public FastReader(){
			br = new BufferedReader(new InputStreamReader(System.in));
		}
		
		String next(){
			while(st == null || !st.hasMoreElements()){
				try{
					st = new StringTokenizer(br.readLine());
				}
				catch(IOException e){
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}
		
		int nextInt(){
			return Integer.parseInt(next());
		}
		long nextLong(){
			return Long.parseLong(next());
		}
		double nextDouble(){
			return Double.parseDouble(next());
		}
		String nextLine(){
			String str = "";
			try{
				str = br.readLine();
			}
			catch(IOException e){
				e.printStackTrace();
			}
			return str;
		}
	}
	

	static public void main(String args[]){
		FastReader in = new FastReader();
		
		int n;
		n = in.nextInt();
	
		String a;
		int b;
		
		int n1 = 0, n2 = 1023;
		for(int i=0; i<n; i++) {
			a = in.next();
			b = in.nextInt();
			
			switch(a.charAt(0)) {
			case '|' : n1 = (n1 | b);
					   n2 = (n2 | b);
					   break;
			case '&' : n1 = (n1 & b);
			   		   n2 = (n2 & b);
			           break;
			case '^' : n1 = (n1 ^ b);
			           n2 = (n2 ^ b);
			           break;
			}
		}
		
		String r1 = appendZeroes(Integer.toBinaryString(n1));
		String r2 = appendZeroes(Integer.toBinaryString(n2));
		
		StringBuilder and = new StringBuilder("1111111111");
		StringBuilder or = new StringBuilder("0000000000");
		StringBuilder xor = new StringBuilder("0000000000");
		
		for(int i=0; i<10; i++) { 
			if(r1.charAt(i) == '0' && r2.charAt(i) == '0')
				and.setCharAt(i, '0');
			if(r1.charAt(i) == '0' && r2.charAt(i) == '1')
				and.setCharAt(i, '1');
			if(r1.charAt(i) == '1' && r2.charAt(i) == '0')
				xor.setCharAt(i, '1');
			if(r1.charAt(i) == '1' && r2.charAt(i) == '1')
				or.setCharAt(i, '1');
		}
		
		int andc, oc, xc;
		andc = Integer.parseInt(and.toString(), 2);
		oc = Integer.parseInt(or.toString(), 2);
		xc = Integer.parseInt(xor.toString(), 2);
		
		System.out.println(3);
		System.out.println("& " + andc);
		System.out.println("| " + oc);
		System.out.println("^ " + xc);
		
	}
}