#include <bits/stdc++.h>
using namespace std;
const int MAXN = (int)5e5 + 5;
char a[MAXN];
int b[MAXN];
int cal(const int n, const int p, const int u) {
  int cur(0);
  if (u == 1) cur |= (1 << p);
  for (int i(1); i <= n; ++i) {
    if (a[i] == '&')
      cur &= b[i];
    else if (a[i] == '|')
      cur |= b[i];
    else
      cur ^= b[i];
  }
  if (u == 0) return cur;
  int res = (cur >> p) & 1;
  return res;
}
void solve(const int n) {
  int x(0), y(0), z((1 << 10) - 1);
  int tmp = cal(n, 0, 0);
  for (int p(0); p < 10; ++p) {
    int change0 = (tmp >> p) & 1;
    int change1 = cal(n, p, 1);
    if (change0 == 1 && change1 == 1)
      y |= (1 << p);
    else if (change0 == 0 && change1 == 0)
      z -= (1 << p);
    else if (change0 == 1 && change1 == 0)
      x |= (1 << p);
  }
  puts("3");
  printf("^ %d\n", x);
  printf("| %d\n", y);
  printf("& %d\n", z);
}
int main() {
  int n;
  scanf("%d", &n);
  char tmp[5];
  for (int i(1); i <= n; ++i) {
    scanf("%s %d", tmp, b + i);
    a[i] = tmp[0];
  }
  solve(n);
  return 0;
}
