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.File;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.PrintStream;
import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;

/*
 public class _879C {

 }

 */

public class _879C {
  enum state {
    same, zero, one, opp
  }

  public void solve() throws FileNotFoundException {
    InputStream inputStream = System.in;

    InputHelper inputHelper = new InputHelper(inputStream);

    PrintStream out = System.out;

    // actual solution
    int n = inputHelper.readInteger();

    state[] states = new state[10];

    for (int i = 0; i < 10; i++) {
      states[i] = state.same;
    }

    for (int i = 0; i < n; i++) {
      char c = inputHelper.read().charAt(0);
      int num = inputHelper.readInteger();

      for (int j = 0; j < 10; j++) {
        int cnum = (num & (1 << j));

        if (cnum != 0) {
          if (c == '|') {
            states[j] = state.one;
          }
          if (c == '^') {
            switch (states[j]) {
              case one:
                states[j] = state.zero;
                break;
              case opp:
                states[j] = state.same;
                break;
              case same:
                states[j] = state.opp;
                break;
              case zero:
                states[j] = state.one;
                break;
            }
          }
        } else {
          if (c == '&') {
            states[j] = state.zero;
          }
        }
      }
    }

    int and = 1023, or = 0, xor = 0;
    for (int i = 0; i < 10; i++) {
      if (states[i] == state.one) {
        or |= (1 << i);
      } else if (states[i] == state.zero) {
        and &= ~(1 << i);
      } else if (states[i] == state.opp) {
        xor |= (1 << i);
      }
    }

    System.out.println(3);

    System.out.println("| " + or);
    System.out.println("& " + and);
    System.out.println("^ " + xor);
    // end here
  }

  public static void main(String[] args) throws FileNotFoundException {
    (new _879C()).solve();
  }

  class InputHelper {
    StringTokenizer tokenizer = null;
    private BufferedReader bufferedReader;

    public InputHelper(InputStream inputStream) {
      InputStreamReader inputStreamReader = new InputStreamReader(inputStream);
      bufferedReader = new BufferedReader(inputStreamReader, 16384);
    }

    public String read() {
      while (tokenizer == null || !tokenizer.hasMoreTokens()) {
        try {
          String line = bufferedReader.readLine();
          if (line == null) {
            return null;
          }
          tokenizer = new StringTokenizer(line);
        } catch (IOException e) {
          e.printStackTrace();
        }
      }

      return tokenizer.nextToken();
    }

    public Integer readInteger() {
      return Integer.parseInt(read());
    }

    public Long readLong() {
      return Long.parseLong(read());
    }
  }
}