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;
template <class T>
T max2(const T &a, const T &b) {
  return (a < b ? b : a);
}
template <class T>
T min2(const T &a, const T &b) {
  return (a > b ? b : a);
}
template <class T>
T max3(const T &a, const T &b, const T &c) {
  return max2(a, max2(b, c));
}
template <class T>
T min3(const T &a, const T &b, const T &c) {
  return min2(a, min2(b, c));
}
template <class T>
T gcd(const T a, const T b) {
  return (b ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(const T a, const T b) {
  return (a / gcd<T>(a, b) * b);
}
template <class T>
T mod(const T &a, const T &b) {
  return (a < b ? a : a % b);
}
long long int power(long long int x, long long int n) {
  long long int result = 1;
  while (n > 0) {
    if (n % 2 == 1) result = (result * x) % 1000000007;
    x = (x * x) % 1000000007;
    n = n / 2;
  }
  return result;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int first = 0;
  long long int last = 1023;
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    char temp;
    cin >> temp;
    int val;
    cin >> val;
    if (temp == '|') {
      first = (first | val);
      last = (last | val);
    }
    if (temp == '&') {
      first = (first & val);
      last = (last & val);
    }
    if (temp == '^') {
      first = (first ^ val);
      last = (last ^ val);
    }
  }
  int firstarray[10] = {0};
  int i = 0;
  int lastarray[10] = {0};
  while (first != 0) {
    firstarray[i] = first % 2;
    first = first / 2;
    i++;
  }
  i = 0;
  while (last != 0) {
    lastarray[i] = last % 2;
    last = last / 2;
    i++;
  }
  int ors[10] = {0};
  int xors[10] = {0};
  int ands[10];
  for (int i = 0; i < 10; i++) ands[i] = 1;
  for (int i = 0; i < 10; i++) {
    if (firstarray[i] == 1 && lastarray[i] == 1) {
      ors[i] = 1;
    } else {
      if (firstarray[i] == 0 && lastarray[i] == 1) {
        ors[i] = 0;
      } else {
        if (firstarray[i] == 1 && lastarray[i] == 0) {
          xors[i] = 1;
        } else {
          ands[i] = 0;
        }
      }
    }
  }
  int orval = 0;
  int xorval = 0;
  int andval = 0;
  for (int i = 0; i < 10; i++) {
    orval += ors[i] * power(2, i);
    xorval += xors[i] * power(2, i);
    andval += ands[i] * power(2, i);
  }
  cout << "3" << endl;
  cout << '&' << " " << andval << endl;
  cout << '^' << " " << xorval << endl;
  cout << '|' << " " << orval << endl;
}