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

public class ProblemD {

	static Scanner sc = new Scanner(System.in);
	static PrintWriter pw = new PrintWriter(System.out);

	public static void main(String[] args) throws IOException {
		int n = sc.nextInt();
		int a[] = new int[10];
		Arrays.fill(a, 3);
		// 0 = clear , 1 = set, 3 = x , 4 = comp(x)
		for (int i = 0; i < n; i++) {
			char c = sc.next().charAt(0);
			String s = Integer.toBinaryString(sc.nextInt());
			for (int j = 0; j < s.length(); j++) {
				int pos = 10 - s.length() + j;
				if (c == '&') {
					if (s.charAt(j) == '0')
						a[pos] = 0;
				} else if (c == '|') {
					if (s.charAt(j) == '1')
						a[pos] = 1;
				} else {
					if (s.charAt(j) == '1') {
						if (a[pos] == 3)
							a[pos] = 4;
						else if (a[pos] == 4)
							a[pos] = 3;
						else if (a[pos] == 1)
							a[pos] = 0;
						else
							a[pos] = 1;
					}
				}
			}
			for (int j = 0; j < 10 - s.length(); j++) {
				if (c == '&') {
					a[j] = 0;
				}
			}
		}
		StringBuilder and = new StringBuilder(), or = new StringBuilder(), xor = new StringBuilder();
		for (int i = 0; i < 10; i++) {
			if (a[i] == 0) {
				or.append(0);
				and.append(0);
				xor.append(0);
			} else if (a[i] == 1) {
				xor.append(0);
				or.append(1);
				and.append(1);
			} else if (a[i] == 4) {
				or.append(0);
				and.append(1);
				xor.append(1);
			} else {
				xor.append(0);
				or.append(0);
				and.append(1);
			}
		}
		pw.println(3);
//		 System.out.println(and);
//		 System.out.println(or);
//		 System.out.println(xor);
		pw.println("& " + Integer.parseInt(and.toString(), 2));
		pw.println("| " + Integer.parseInt(or.toString(), 2));
		pw.println("^ " + Integer.parseInt(xor.toString(), 2));

		pw.flush();
	}

	static 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());
		}
	}
}