#include <bits/stdc++.h>
const int INF = 0x3f3f3f3f;
const long long int LINF = 0x3f3f3f3f3f3f3f3f;
const double EPS = 1e-6;
const int mod = 1000000009;
using namespace std;
int n, v[500050], bit[10];
char op[500050];
int main() {
  for (int i = (int)(0); i < (int)(10); ++i) bit[i] = 2;
  scanf("%d ", &n);
  for (int i = (int)(0); i < (int)(n); ++i) {
    scanf(" %c %d", &op[i], &v[i]);
    if (op[i] == '&') {
      for (int j = (int)(0); j < (int)(10); ++j)
        if (!(v[i] & (1 << j))) bit[j] = 0;
    } else if (op[i] == '|') {
      for (int j = (int)(0); j < (int)(10); ++j)
        if (v[i] & (1 << j)) bit[j] = 1;
    } else {
      for (int j = (int)(0); j < (int)(10); ++j)
        if (v[i] & (1 << j)) {
          if (abs(bit[j]) == 2)
            bit[j] *= -1;
          else
            bit[j] = 1 - bit[j];
        }
    }
  }
  vector<pair<char, int> > res;
  int val = 0;
  for (int i = (int)(0); i < (int)(10); ++i)
    if (bit[i] != 0) val |= (1 << i);
  res.push_back({'&', val});
  val = 0;
  for (int i = (int)(0); i < (int)(10); ++i)
    if (bit[i] == 1) val |= (1 << i);
  res.push_back({'|', val});
  val = 0;
  for (int i = (int)(0); i < (int)(10); ++i)
    if (bit[i] == -2) val |= (1 << i);
  res.push_back({'^', val});
  val = 0;
  cout << res.size() << endl;
  for (int i = (int)(0); i < (int)(res.size()); ++i)
    cout << res[i].first << " " << res[i].second << endl;
  return 0;
}
