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.
#include <bits/stdc++.h>
using namespace std;
vector<long long int> v;
void fun1(long long int n) {
  for (long long int i = 0; i < 10; ++i) {
    long long int b = (n >> i) & 1;
    if (b == 0) {
      v[i] = 0;
    } else {
    }
  }
}
void fun2(long long int n) {
  for (long long int i = 0; i < 10; ++i) {
    long long int b = (n >> i) & 1;
    if (b == 0) {
    } else {
      v[i] = 1;
    }
  }
}
void fun3(long long int n) {
  for (long long int i = 0; i < 10; ++i) {
    long long int b = (n >> i) & 1;
    if (b == 0) {
    } else {
      if (v[i] == 0) {
        v[i] = 1;
      } else if (v[i] == 1) {
        v[i] = 0;
      } else if (v[i] == 2) {
        v[i] = 3;
      } else {
        v[i] = 2;
      }
    }
  }
}
int main() {
  for (long long int i = 0; i < 10; ++i) v.push_back(2);
  long long int n;
  cin >> n;
  char ch;
  long long int tt;
  for (long long int i = 0; i < n; ++i) {
    cin >> ch >> tt;
    if (ch == '&') {
      fun1(tt);
    } else if (ch == '|') {
      fun2(tt);
    } else {
      fun3(tt);
    }
  }
  vector<pair<char, long long int> > aa;
  long long int ans = 0;
  long long int mul = 1;
  for (long long int i = 0; i < 10; ++i) {
    if (v[i] == 0) {
    } else {
      ans = ans + mul;
    }
    mul = mul * 2;
  }
  if (ans != 1023) aa.push_back({'&', ans});
  ans = 0;
  mul = 1;
  for (long long int i = 0; i < 10; ++i) {
    if (v[i] == 1) {
      ans = ans + mul;
    } else {
    }
    mul = mul * 2;
  }
  if (ans != 0) aa.push_back({'|', ans});
  ans = 0;
  mul = 1;
  for (long long int i = 0; i < 10; ++i) {
    if (v[i] == 3) {
      ans = ans + mul;
    } else {
    }
    mul = mul * 2;
  }
  if (ans != 0) aa.push_back({'^', ans});
  cout << aa.size() << endl;
  for (long long int i = 0; i < aa.size(); ++i)
    cout << aa[i].first << " " << aa[i].second << endl;
  return 0;
}
