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;
mt19937 rnd;
template <class T>
inline void opt(T &a, T b) {
  a = max(a, b);
}
inline int rndInt(int x) { return rnd() % x; }
inline int R(int l, int r) { return l + rndInt(r - l + 1); }
char Cur;
inline char getChar() {
  char t = Cur;
  Cur = getchar();
  return t;
}
template <class telem>
inline void readInt(telem &a) {
  a = 0;
  while (!isdigit(Cur) && Cur != '-') getChar();
  telem mlt = 1;
  if (Cur == '-') {
    mlt = -1;
    getChar();
  }
  while (isdigit(Cur)) {
    a *= 10;
    a += getChar() - '0';
  }
  a *= mlt;
}
template <class T1, class T2>
inline void readInt(T1 &a, T2 &b) {
  readInt(a);
  readInt(b);
}
template <class T1, class T2, class T3>
inline void readInt(T1 &a, T2 &b, T3 &c) {
  readInt(a);
  readInt(b);
  readInt(c);
}
int tp[10];
int cnt[10];
int n;
string t[500005];
int val[500005];
void pre() {}
void load() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> t[i] >> val[i];
    for (int j = 0; j < 10; j++) {
      int v = (val[i] >> j) & 1;
      if (v && t[i][0] == '|') {
        tp[j] = 1;
        cnt[j] = 0;
      }
      if (!v && t[i][0] == '&') {
        cnt[j] = 0;
        tp[j] = 2;
      }
      if (v && t[i][0] == '^') {
        cnt[j] ^= 1;
      }
    }
  }
}
void solve() {
  int Xor = 0;
  int Or = 0;
  int And = (1 << 10) - 1;
  for (int i = 0; i < 10; i++) {
    if (cnt[i]) Xor |= 1 << i;
    if (!tp[i]) continue;
    if (tp[i] == 1) {
      Or |= 1 << i;
    }
    if (tp[i] == 2) {
      And ^= 1 << i;
    }
  }
  cout << 3 << endl;
  cout << "& " << And << endl;
  cout << "| " << Or << endl;
  cout << "^ " << Xor << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  pre();
  double st = clock();
  int T = 1;
  while (T-- > 0) {
    load();
    solve();
  }
  return 0;
}
