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 + 4;
char op[5];
int n, bits[10], cst, xAdd[10];
int main() {
  memset(bits, -1, sizeof(bits));
  memset(xAdd, 0, sizeof(xAdd));
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%s%d", op, &cst);
    if (*op == '|') {
      for (int j = 0; j < 10; ++j)
        if ((1 << j) & cst) bits[j] = 1;
    } else if (*op == '&') {
      for (int j = 0; j < 10; ++j)
        if (!((1 << j) & cst)) bits[j] = 0;
    } else {
      for (int j = 0; j < 10; ++j) {
        if (bits[j] >= 0) {
          bits[j] = (bits[j] == !((1 << j) & cst));
        } else if ((1 << j) & cst) {
          (++xAdd[j]) %= 2;
        }
      }
    }
  }
  int orNum = 0, xorNum = 0, andNum = 0;
  for (int i = 0; i < 10; ++i) {
    if (bits[i] < 0) andNum |= (1 << i);
    if (bits[i] == 1) orNum |= (1 << i);
    if (xAdd[i] == 1) xorNum |= (1 << i);
  }
  printf("%d\n", 3);
  printf("& %d\n", andNum);
  printf("| %d\n", orNum);
  printf("^ %d\n", xorNum);
  return 0;
}
