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>
using namespace std;
string ToBin(int x) {
  int n = x;
  string ans = "";
  while (n != 0) {
    int r = (n % 2);
    if (r == 1)
      ans += "1";
    else
      ans += "0";
    n /= 2;
  }
  while (ans.length() < 10) {
    ans += "0";
  }
  reverse(ans.begin(), ans.end());
  return ans;
}
int BinToInt(string b) {
  int cp = 0;
  int ans = 0;
  for (int i = b.length() - 1; i >= 0; i--) {
    if (b[i] == '1') {
      ans += pow(2, cp);
    }
    cp++;
  }
  return ans;
}
int main() {
  vector<pair<string, char> > operations;
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    char op;
    int operand;
    cin >> op >> operand;
    operations.push_back(make_pair(ToBin(operand), op));
  }
  vector<int> columnOperations;
  for (int column = 0; column < 10; column++) {
    int n1 = 0;
    for (int curOpIndex = 0; curOpIndex < n; curOpIndex++) {
      string curOpStr = operations[curOpIndex].first;
      char opType = operations[curOpIndex].second;
      if (opType == '|') {
        n1 = (n1 | (curOpStr[column] - '0'));
      } else if (opType == '^') {
        n1 = (n1 ^ (curOpStr[column] - '0'));
      } else {
        n1 = (n1 & (curOpStr[column] - '0'));
      }
    }
    int n2 = 1;
    for (int curOpIndex = 0; curOpIndex < n; curOpIndex++) {
      string curOpStr = operations[curOpIndex].first;
      char opType = operations[curOpIndex].second;
      if (opType == '|') {
        n2 = (n2 | (curOpStr[column] - '0'));
      } else if (opType == '^') {
        n2 = (n2 ^ (curOpStr[column] - '0'));
      } else {
        n2 = (n2 & (curOpStr[column] - '0'));
      }
    }
    if (n1 == 1 && n2 == 0) {
      columnOperations.push_back(2);
    } else if (n1 == 0 && n2 == 0) {
      columnOperations.push_back(0);
    } else if (n1 == 1 && n2 == 1) {
      columnOperations.push_back(1);
    } else {
      columnOperations.push_back(3);
    }
  }
  string firstOpStr = "";
  for (int i = 0; i < columnOperations.size(); i++) {
    if (columnOperations[i] == 0) {
      firstOpStr += "0";
    } else {
      firstOpStr += "1";
    }
  }
  string secondOpStr = "";
  for (int i = 0; i < columnOperations.size(); i++) {
    if (columnOperations[i] == 1) {
      secondOpStr += "1";
    } else {
      secondOpStr += "0";
    }
  }
  string thirdOpStr = "";
  for (int i = 0; i < columnOperations.size(); i++) {
    if (columnOperations[i] == 2) {
      thirdOpStr += "1";
    } else {
      thirdOpStr += "0";
    }
  }
  int firstOp = BinToInt(firstOpStr);
  int secondOp = BinToInt(secondOpStr);
  int thirdOp = BinToInt(thirdOpStr);
  int pl = 3;
  cout << pl << "\n";
  cout << "& " << firstOp << "\n";
  cout << "| " << secondOp << "\n";
  cout << "^ " << thirdOp << "\n";
  return 0;
}