#include <bits/stdc++.h>
using namespace std;
const int INF = 2e9 + 999;
const long long LINF = 2e18 + 999;
void inv(bool e);
template <typename T>
T sign(T a);
template <typename T>
void die(T &a);
template <typename T>
void umax(T &a, T b);
template <typename T>
void umin(T &a, T b);
bool brute, alter;
int cnt_tests = 1;
int n;
void inp() { cin >> n; }
void solve() {
  int zero = 0, all1 = 1023;
  char type;
  int val;
  for (int i = 0; i < n; ++i) {
    cin >> type >> val;
    if (type == '|') {
      zero |= val;
      all1 |= val;
    }
    if (type == '&') {
      zero &= val;
      all1 &= val;
    }
    if (type == '^') {
      zero ^= val;
      all1 ^= val;
    }
  }
  int XOR = 0, OR = 0, AND = 1023;
  for (int i = 9; i >= 0; --i) {
    if (((zero >> i) & 1) && !((all1 >> i) & 1)) {
      XOR = (XOR | (1 << i));
    } else if (((zero >> i) & 1)) {
      OR = (OR | (1 << i));
    } else if (!((all1 >> i) & 1)) {
      AND = (AND ^ (1 << i));
    }
  }
  cout << 3 << '\n';
  cout << "| " << OR << '\n';
  cout << "^ " << XOR << '\n';
  cout << "& " << AND << '\n';
}
void stress() {}
void naive() {}
void run();
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  if (0) {
    freopen("palindrome.in", "r", stdin);
    freopen("palindrome.out", "w", stdout);
  }
  srand(time(0));
  brute = false;
  for (int i = 0; (i < cnt_tests); i++) {
    run();
  }
  return 0;
}
void run() {
  if (!brute) {
    inp();
  } else {
    stress();
  }
  solve();
  cout << '\n';
}
template <typename T>
void die(T &a) {
  cout << a;
  exit(0);
}
template <typename T>
T sign(T a) {
  if (a == 0) return 0;
  if (a < 0) return -1;
  return 1;
}
template <typename T>
void umax(T &a, T b) {
  if (b > a) a = b;
}
template <typename T>
void umin(T &a, T b) {
  if (b < a) a = b;
}
void inv(bool e) {
  if (!e) {
    vector<int> a;
    a[-1] += 1;
  }
}
