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 CPP):

Solution:
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("avx,tune=native")
using namespace std;
struct state {
  int tp;
};
state states[10];
void ander(int ind, int vl) {
  if (vl == 1)
    return;
  else
    states[ind].tp = 1;
}
void orer(int ind, int vl) {
  if (vl == 0)
    return;
  else
    states[ind].tp = 2;
}
void xorer(int ind, int vl) {
  if (vl == 0) return;
  if (states[ind].tp == 1)
    states[ind].tp = 2;
  else if (states[ind].tp == 2)
    states[ind].tp = 1;
  else if (states[ind].tp == 3)
    states[ind].tp = 0;
  else
    states[ind].tp = 3;
}
int toxor[10], toor[10], toand[10];
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  for (__typeof(10) i = (0) - ((0) > (10)); i != (10) - ((0) > (10));
       i += 1 - 2 * ((0) > (10)))
    states[i].tp = 0;
  int n;
  cin >> n;
  for (__typeof(n) i = (0) - ((0) > (n)); i != (n) - ((0) > (n));
       i += 1 - 2 * ((0) > (n))) {
    char ch;
    int vl;
    cin >> ch >> vl;
    for (__typeof(10) i = (0) - ((0) > (10)); i != (10) - ((0) > (10));
         i += 1 - 2 * ((0) > (10))) {
      if (ch == '&') ander(i, (vl >> i) & 1);
      if (ch == '|') orer(i, (vl >> i) & 1);
      if (ch == '^') xorer(i, (vl >> i) & 1);
    }
  }
  for (__typeof(10) i = (0) - ((0) > (10)); i != (10) - ((0) > (10));
       i += 1 - 2 * ((0) > (10)))
    toand[i] = 1;
  for (__typeof(10) i = (0) - ((0) > (10)); i != (10) - ((0) > (10));
       i += 1 - 2 * ((0) > (10))) {
    if (states[i].tp == 2) toor[i] = 1;
    if (states[i].tp == 1) toand[i] = 0;
    if (states[i].tp == 3) toxor[i] = 1;
  }
  cout << 3 << '\n';
  long long val = 0;
  for (__typeof(10) i = (0) - ((0) > (10)); i != (10) - ((0) > (10));
       i += 1 - 2 * ((0) > (10)))
    if (toor[i]) val += 1 << i;
  cout << "| " << val << '\n';
  val = 0;
  for (__typeof(10) i = (0) - ((0) > (10)); i != (10) - ((0) > (10));
       i += 1 - 2 * ((0) > (10)))
    if (toand[i]) val += 1 << i;
  cout << "& " << val << '\n';
  val = 0;
  for (__typeof(10) i = (0) - ((0) > (10)); i != (10) - ((0) > (10));
       i += 1 - 2 * ((0) > (10)))
    if (toxor[i]) val += 1 << i;
  cout << "^ " << val << '\n';
  val = 0;
  return 0;
}