#include <bits/stdc++.h>
using namespace std;
int expect[10][2] = {0};
char cmd[] = "|^&";
vector<char> ansc;
vector<int> ansa;
bool solve_rec(int depth, int max_depth, int p, vector<char> &c,
               vector<int> &a) {
  if (depth == max_depth) {
    {
      int m = 1 << p;
      for (int y = 0; y <= m; y += m) {
        int x = y;
        for (int i = 0; i < depth; ++i) {
          if (c[i] == '|') x = x | a[i];
          if (c[i] == '^') x = x ^ a[i];
          if (c[i] == '&') x = x & a[i];
        }
        if (expect[p][y / m] != (x & m)) return false;
      }
    }
    ansc = c;
    ansa = a;
    return true;
  }
  for (int i = 0; i < 2; ++i) {
    a[depth] |= (i << p);
    bool res = solve_rec(depth + 1, max_depth, p, c, a);
    if (res) return true;
    a[depth] &= ~(i << p);
  }
  return false;
}
bool solve(int max_depth, vector<char> &c) {
  vector<int> a(c.size(), 0);
  bool res = 1;
  for (int p = 0; p < 10; ++p) res &= solve_rec(0, max_depth, p, c, a);
  return res;
}
bool req_op(int depth, vector<char> &c) {
  if (depth) {
    bool res = solve(depth, c);
    if (res) return true;
  }
  if (5 <= depth) return false;
  for (int i = 0; i < 3; ++i) {
    c.push_back(cmd[i]);
    bool res = req_op(depth + 1, c);
    if (res) return true;
    c.pop_back();
  }
  return false;
}
int main() {
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  vector<char> c(n);
  vector<int> a(n);
  for (int i = 0; i < n; ++i) cin >> c[i] >> a[i];
  for (int p = 0; p < 10; ++p) {
    int m = 1 << p;
    for (int y = 0; y <= m; y += m) {
      int x = y;
      for (int i = 0; i < n; ++i) {
        if (c[i] == '|') x = x | a[i];
        if (c[i] == '^') x = x ^ a[i];
        if (c[i] == '&') x = x & a[i];
      }
      expect[p][y / m] = (x & m);
    }
  }
  vector<char> tmp;
  req_op(0, tmp);
  cout << ansc.size() << "\n";
  for (int i = 0; i < ansc.size(); ++i) {
    cout << ansc[i] << " " << ansa[i] << "\n";
  }
  return 0;
}
