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

public class P {

	// PURPLE TO BE

	static int getOP(char x) {
		switch (x) {
		case '&':
			return 0;
		case '|':
			return 1;
		case '^':
			return 2;
		}
		return -1;
	}

	public static void main(String[] args) throws IOException {

		Scanner sc = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		int N = sc.nextInt();
		int[] op = new int[N], x = new int[N];
		for (int i = 0; i < N; ++i) {
			op[i] = getOP(sc.next().charAt(0));
			x[i] = sc.nextInt();
		}
		int x_and = 0, x_or = 0, x_xor = 0;
		// TODO: check status of each bit
		for (int i = 0; i < 10; ++i) {
			int o = 1, z = 0;
			for (int j = 0; j < N; ++j) {
				int curBit = (x[j] & (1 << i)) != 0 ? 1 : 0;
				if (op[j] == 0) {
					// AND
					z &= curBit;
					o &= curBit;
				} else if (op[j] == 1) {
					// OR
					z |= curBit;
					o |= curBit;
				} else {
					// XOR
					z ^= curBit;
					o ^= curBit;
				}
			}

			if (z == 1 && o == 1)
				x_or |= (1 << i);

			if (z == 1 && o == 0) {
				x_and |= (1 << i);
				x_xor |= (1 << i);
			}
			if (z == 0 && o == 1) {
				x_and |= (1 << i);
			}
			if (z == 0 && o == 0) {
				// trivial case
			}
		}

		out.println(3);
		out.println("& " + x_and);
		out.println("| " + x_or);
		out.println("^ " + x_xor);
		out.flush();
		out.close();
	}

	static class Scanner {
		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream s) {
			br = new BufferedReader(new InputStreamReader(s));
		}

		public Scanner(String file) throws FileNotFoundException {
			br = new BufferedReader(new FileReader(file));
		}

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

}