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;
using unum = uint64_t;
using num = int64_t;
using u64 = unum;
using i64 = num;
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& t) {
  return os << '[' << t.first << ',' << t.second << ']';
}
constexpr uint64_t print_limit = 32;
template <typename It>
void print(ostream& os, It begin, It end, uint64_t len) {
  uint64_t count = 0;
  os << "{";
  while (begin != end && count < print_limit) {
    os << "(" << *begin << ")";
    count++;
    begin++;
  }
  if (begin != end) os << "... " << len << " total";
  os << "}";
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& t) {
  print(os, t.begin(), t.end(), t.size());
  return os;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const map<T1, T2>& t) {
  print(os, t.begin(), t.end(), t.size());
  return os;
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& t) {
  print(os, t.begin(), t.end(), t.size());
  return os;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const unordered_map<T1, T2>& t) {
  print(os, t.begin(), t.end(), t.size());
  return os;
}
template <typename T>
ostream& operator<<(ostream& os, const unordered_set<T>& t) {
  print(os, t.begin(), t.end(), t.size());
  return os;
}
template <typename T>
T read() {
  T e;
  cin >> e;
  return e;
}
template <typename T>
vector<T> readv(unum n) {
  vector<T> v;
  for (unum i = 0; i < n; i++) v.push_back(read<T>());
  return v;
}
template <typename T>
void print(const T& t) {
  cout << t << " ";
}
void println() { cout << '\n'; }
template <typename T>
void println(const T& t) {
  print(t);
  println();
}
template <typename T>
struct identity {
  const T& operator()(const T& t) const { return t; }
};
template <typename T, typename F = identity<typename T::value_type>>
void printv(const T& t, F f = F()) {
  for (const auto& e : t) print(f(e));
  println();
}
struct Op {
  char symbol;
  u64 val;
};
const u64 BITS = 10;
bool calc(const vector<Op>& ops, u64 i, bool v) {
  for (const auto& op : ops) {
    const bool new_v = op.val & (1u << i);
    if (op.symbol == '|') v |= new_v;
    if (op.symbol == '&') v &= new_v;
    if (op.symbol == '^') v ^= new_v;
  }
  return v;
}
void go() {
  vector<Op> ops(read<u64>());
  for (u64 i = 0; i < ops.size(); i++) {
    auto s = read<string>();
    ops[i].symbol = s[0];
    ops[i].val = read<u64>();
  }
  u64 vor = 0, vxor = 0;
  for (u64 i = 0; i < BITS; i++) {
    bool bor = false, bxor = false;
    const bool result_for_1 = calc(ops, i, true);
    const bool result_for_0 = calc(ops, i, false);
    if (result_for_1 && result_for_0) bor = true;
    if (!result_for_1 && !result_for_0) {
      bxor = true;
      bor = true;
    }
    if (!result_for_1 && result_for_0) bxor = true;
    if (bor) vor |= 1u << i;
    if (bxor) vxor |= 1u << i;
  }
  cout << "2\n| " << vor << "\n^ " << vxor << "\n";
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  go();
}
