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.Arrays;
import java.util.StringTokenizer;

/*


3
| 3
^ 1
| 1

 */

// 123232323231
public class a {
	public static void main(String[] args) throws IOException {
		FastScanner in = new FastScanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		int n = in.nextInt();
		int fullMask = 0b1111111111;
		int curAnd = fullMask;
		int curOr = 0b0;
		int curXor = 0;
//		String[] ss = new String[n];
//		int[] vv = new int[n];
		for (int i = 0; i < n; i++) {
			String s = in.next();
			int v = in.nextInt();
//			ss[i] = s;
//			vv[i] = v;
			if (s.equals("|")) {
				curOr |= v;
				curAnd |= v;
				curXor &= ~v;
			} else if (s.equals("&")) {
				curAnd &= v;
				curOr &= v;
				curXor &= v;
			} else if (s.equals("^")) {
				curXor ^= v;
				// int oldAnd = curAnd;
				// int oldOr = curOr;
				// for(int j=0;j<10;j++) {
				// if(((v >>> j) & 1) == 1) {
				//
				// }
				// }
				//
				// curAnd = ~oldOr;

			}
		}
//		String[] ss2 = new String[3];
//		int[] vv2 = new int[3];
//		ss2[0] = "&";
//		ss2[1] = "|";
//		ss2[2] = "^";
//		vv2[0] = curAnd;
//		vv2[1] = curOr;
//		vv2[2] = curXor;
//		for (int i = 0; i <= 1023; i++) {
//			int v1 = eval(ss, vv, i);
//			int v2 = eval(ss2, vv2, i);
//			if (v1 != v2) {
//				System.out.println(1 / 0);
//			}
//		}
		System.out.println(3);
		System.out.println("& " + curAnd);
		System.out.println("| " + curOr);
		System.out.println("^ " + curXor);

		out.close();
	}

	static int eval(String[] ss, int[] vv, int v) {

		for (int i = 0; i < ss.length; i++) {
			if (ss[i].equals("^")) {
				v ^= vv[i];
			}
			if (ss[i].equals("&")) {
				v &= vv[i];
			}
			if (ss[i].equals("|")) {
				v |= vv[i];
			}
		}
		return v;
	}

	static int set(int mask, int loc, int v) {
		mask &= ~(1 << loc);
		mask |= 1 << v;
		return mask;
	}

	static class FastScanner {
		BufferedReader br;
		StringTokenizer st;

		public FastScanner(InputStream i) {
			br = new BufferedReader(new InputStreamReader(i));
			st = null;
		}

		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 double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}

		public int[] nextIntArray(int n) throws IOException {
			int[] arr = new int[n];
			for (int i = 0; i < n; i++)
				arr[i] = nextInt();
			return arr;
		}

		public long[] nextLongArray(int n) throws IOException {
			long[] arr = new long[n];
			for (int i = 0; i < n; i++)
				arr[i] = nextInt();
			return arr;
		}

		public String[] nextStringArray(int n) throws IOException {
			String[] arr = new String[n];
			for (int i = 0; i < n; i++)
				arr[i] = next();
			return arr;
		}
	}
}