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.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
 
public class Solution {
	public static void main(String[] args) {
		InputReader in = new InputReader();
		PrintWriter out = new PrintWriter(System.out);
		Thread th = new Thread(null, new Runnable(){public void run(){new Task1().solve(in, out);}},"Task1",1<<25);
		try{
			th.start();
			th.join();
		} catch(InterruptedException e){}
		out.close();
	}

	static class Task1 {
		static final int MAX = 10;
		static final int MOD = 1000000007;
		public void solve(InputReader in, PrintWriter out){ 
			int n = in.nextInt();
			int[] bits = new int[10];
			Arrays.fill(bits, -1);

			/*
				-1 = same
				0,1
				2 = ^1
			*/

			for(int j=0; j<n; j++){
				String line = in.nextLine();
				char operation = line.charAt(0);
				int[] binary = convert(Integer.parseInt(line.substring(2)));

				switch(operation){
					case '|':
					for(int i=0; i<MAX; i++){
						if(binary[i]==1){
							bits[i] = 1;
						}
					}
					break;

					case '^':
					for(int i=0; i<MAX; i++){
						if((bits[i]==0 && binary[i]==1) || (bits[i]==1 && binary[i]==0)){
							bits[i] = 1;
						} else if((bits[i]==0 && binary[i]==0) || (bits[i]==1 && binary[i]==1)){
							bits[i] = 0;
						} else if(bits[i]==-1 && binary[i]==1){
							bits[i] = 2;
						} else if(bits[i]==2 && binary[i]==1){
							bits[i] = -1;
						}
					}
					break;

					case '&':
					for(int i=0; i<MAX; i++){
						if(binary[i]==0){
							bits[i] = 0;
						}
					}
					break;
				}
			}

			/*for(int i: bits)
				out.print(i+" ");
			out.println();*/

			int[] a = new int[10];
			int[] o = new int[10];
			int[] x = new int[10];
			for(int i=0; i<10; i++){
				switch(bits[i]){
					case -1:
					x[i] = 0; a[i] = 1; o[i] = 0;
					break;

					case 0:
					x[i] = 0; o[i] = 0; a[i] = 0;
					break;

					case 1:
					x[i] = 0; o[i] = 1; a[i] = 1;
					break;

					case 2:
					x[i] = 1; o[i] = 0; a[i] = 1;
					break;
				}
			}

			out.println(3);
			out.println("^ "+convert(x));
			out.println("& "+convert(a));
			out.println("| "+convert(o));
		}


		int convert(int[] a){
			int ans = 0;
			for(int i=0; i<10; i++){
				ans = (ans*2)+a[i];
			}
			return ans;
		}
		int[] convert(int n){
			int[] ans = new int[10];
			int i=9;
			while(n>0){
				ans[i] = n%2;
				n = n>>1;
				i--;
			}
			return ans;
		}


		long expo(long a, long b, long MOD){
			long result = 1;
			while (b>0){
				if (b%2==1) result=(result*a)%MOD;
				b>>=1;
				a=(a*a)%MOD;
			}
			return result%MOD;
		}
	}
	static class InputReader {
		public BufferedReader reader;
		public StringTokenizer tokenizer;
		public InputReader() {
			reader = new BufferedReader(new InputStreamReader(System.in));
			tokenizer = null;
		}
		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return tokenizer.nextToken();
		}
		public int nextInt() {
			return Integer.parseInt(next());
		}
		public long nextLong() {
			return Long.parseLong(next());
		}
		public double nextDouble() {
			return Double.parseDouble(next());
		}
		public String nextLine() {
			String s=null;
			try{
				s = reader.readLine();
			} catch(IOException e){
				throw new RuntimeException(e);
			}
			return s;
		}
		public String nextParagraph() {
			String line=null;
			String ans = "";
			try{
				while ((line = reader.readLine()) != null) {
				ans += line;
				}
			} catch(IOException e){
				throw new RuntimeException(e);
			}
			return ans;
		}
	}
}