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

public class Q443A {	
	BufferedReader reader;
    StringTokenizer tokenizer;
    PrintWriter out;
    
	public void solve() throws IOException {				
		int N = nextInt();

    char[] operators = new char[N];
    int[][] operands = new int[10][N];

    for (int i = 0; i < N; i++) {
      String[] sp = reader.readLine().split(" ");
      operators[i] = sp[0].charAt(0);

      int op = Integer.parseInt(sp[1]);
      for (int d = 0; d < 10; d++) {
        operands[d][i] = ((op >> d) & 1);
      }
    }

    int and = (1<<10)-1;
    int or = 0;
    int xor = 0;
    for (int d = 0; d < 10; d++) {
      int res0 = compute(0, operators, operands[d]);
      int res1 = compute(1, operators, operands[d]);
      if (res0 == 0 && res1 == 0) {
        and -= (1<<d);
      } else if (res0 == 1 && res1 == 1) {
        or += (1<<d);
      } else if (res0 == 1 && res1 == 0) {
        xor += (1<<d);
      }
    }
    out.println(3);
    out.println("& " + and);
    out.println("| " + or);
    out.println("^ " + xor);
	}

  private int compute(int start, char[] operators, int[] operands) {
    for (int i = 0; i < operators.length; i++) {
      if (operators[i] == '&') {
        start &= operands[i];
      } else if (operators[i] == '|') {
        start |= operands[i];
      } else if (operators[i] == '^') {
        start ^= operands[i];
      }
    }
    return start;
  }
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		new Q443A().run();
	}
	
	public void run() {
        try {
            reader = new BufferedReader(new InputStreamReader(System.in));
            tokenizer = null;
            out = new PrintWriter(System.out);
            solve();
            reader.close();
            out.close();
        } catch (Exception e) {
            e.printStackTrace();
            System.exit(1);
        }
    }

    int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }

    double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }

    String nextToken() throws IOException {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(reader.readLine());
        }
        return tokenizer.nextToken();
    }

}


