#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
const int maxm = 1e3 + 5;
const int mod = 1e9 + 7;
inline void solve() {
  int n, mask = 0, b1 = 0, b2 = 0;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    char op[2];
    int x;
    scanf("%s%d", op, &x);
    if (op[0] == '|') {
      for (int j = 0; j < 10; j++)
        if (x & (1 << j)) {
          mask |= (1 << j);
          b1 |= (1 << j);
        }
    } else if (op[0] == '&') {
      for (int j = 0; j < 10; j++)
        if ((x & (1 << j)) == 0) {
          mask |= 1 << j;
          b1 &= (1 << 10) - 1 - (1 << j);
        }
    } else if (op[0] == '^') {
      for (int j = 0; j < 10; j++)
        if (x & (1 << j)) {
          if (mask & (1 << j)) b1 ^= (1 << j);
          b2 ^= (1 << j);
        }
    }
  }
  puts("3");
  int ans1 = 1023, ans2 = 0, ans3 = 0;
  for (int i = 0; i < 10; i++)
    if (mask & (1 << i)) {
      if (b1 & (1 << i))
        ans2 |= (1 << i);
      else
        ans1 ^= (1 << i);
    } else if (b2 & (1 << i))
      ans3 |= (1 << i);
  printf("& %d\n| %d\n^ %d\n", ans1, ans2, ans3);
}
int main() {
  solve();
  return 0;
}
