#include <bits/stdc++.h>
using namespace std;
int n;
char opt[500010][3];
int x[500010], ans[500010][2];
int getBit(int u, int x) { return x >> u & 1; }
int calc(char u, int a, int b) {
  if (u == '|') return a | b;
  if (u == '&') return a & b;
  return a ^ b;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%s%d", opt[i], &x[i]);
  }
  for (int i = 0; i < 10; ++i) {
    for (int t = 0; t < 2; ++t) {
      ans[i][t] = t;
      for (int j = 1; j <= n; ++j) {
        ans[i][t] = calc(opt[j][0], ans[i][t], getBit(i, x[j]));
      }
    }
  }
  int ans1 = 0, ans2 = 0, ans3 = 0;
  for (int i = 9; i >= 0; --i) {
    if (!ans[i][0] && !ans[i][1]) {
      ans1 = ans1 << 1 | 1;
      ans2 = ans2 << 1 | 1;
      ans3 = ans3 << 1 | 0;
    } else if (ans[i][0] && ans[i][1]) {
      ans1 = ans1 << 1 | 1;
      ans2 = ans2 << 1 | 0;
      ans3 = ans3 << 1 | 1;
    } else if (ans[i][0] && !ans[i][1]) {
      ans1 = ans1 << 1 | 0;
      ans2 = ans2 << 1 | 1;
      ans3 = ans3 << 1 | 1;
    } else if (!ans[i][0] && ans[i][1]) {
      ans1 = ans1 << 1 | 0;
      ans2 = ans2 << 1 | 0;
      ans3 = ans3 << 1 | 1;
    }
  }
  printf("3\n| %d\n^ %d\n& %d\n", ans1, ans2, ans3);
  return 0;
}
