1
& 0
 1
^ 123
 10
^ 218
& 150
| 935
& 61
| 588
& 897
| 411
| 584
^ 800
| 704
 3
& 1
& 3
& 5
 1
| 123
 1
^ 0
 1
| 1023
 3
& 242
^ 506
^ 522
 10
^ 160
& 1021
& 510
^ 470
& 1022
& 251
& 760
& 1016
| 772
| 515
 1
& 1023
 1
| 0
 2
| 56
^ 875
 1
^ 1023
 2
| 999
^ 689
 3
^ 125
^ 377
& 1019
 1
& 123

3
& 0
| 0
^ 0
 3
& 1023
| 0
^ 123
 3
& 763
| 763
^ 0
 3
& 1
| 0
^ 0
 3
& 1023
| 123
^ 0
 3
& 1023
| 0
^ 0
 3
& 1023
| 1023
^ 0
 3
& 1010
| 768
^ 240
 2
| 775
^ 112
 3
& 1023
| 0
^ 0
 3
& 1023
| 0
^ 0
 3
& 983
| 16
^ 835
 3
& 1023
| 0
^ 1023
 3
& 350
| 326
^ 16
 3
& 1019
| 0
^ 256
 3
& 123
| 0
^ 0

#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5 + 50;
struct Operator {
  char ch;
  int x;
} p[maxn];
int n;
int cal(int x) {
  for (int i = 0; i < n; i++) {
    if (p[i].ch == '|')
      x |= p[i].x;
    else if (p[i].ch == '&')
      x &= p[i].x;
    else if (p[i].ch == '^')
      x ^= p[i].x;
  }
  return x;
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> p[i].ch >> p[i].x;
  int an = 0;
  int xo = 0;
  int orr = 0;
  int pos = cal(0);
  for (int i = 0; i < 10; i++) {
    int cur = cal((1 << i));
    if ((cur & (1 << i) == 0) && (pos & (1 << i) == 0))
      continue;
    else if ((cur & (1 << i)) && (pos & (1 << i))) {
      an += (1 << i);
      orr += (1 << i);
    } else if (((cur & (1 << i)) == 0) && (pos & (1 << i))) {
      an += (1 << i);
      xo += (1 << i);
    } else
      an += (1 << i);
  }
  printf("3\n");
  printf("| %d\n", orr);
  printf("& %d\n", an);
  printf("^ %d\n", xo);
  return 0;
}
