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 = 30;
int bits[MAXN];
int main() {
  fill(bits, bits + MAXN, 3);
  int n;
  scanf("%d", &n);
  for (int i = 0; i < (n); i++) {
    char c;
    int k;
    scanf(" %c %d", &c, &k);
    for (int j = 0; j < (MAXN); j++) {
      int cb = k & (1 << j);
      if (c == '&') {
        if (cb == 0) {
          bits[j] = 0;
        }
      } else if (c == '|') {
        if (cb) {
          bits[j] = 1;
        }
      } else if (c == '^' && cb) {
        if (bits[j] == 2) {
          bits[j] = 3;
        } else if (bits[j] == 3) {
          bits[j] = 2;
        } else if (bits[j] == 0) {
          bits[j] = 1;
        } else if (bits[j] == 1) {
          bits[j] = 0;
        }
      }
    }
  }
  int xv = 0;
  int ov = 0;
  int av = 0b1111111111;
  for (int i = 0; i < (MAXN); i++) {
    int cb = i;
    if (bits[cb] == 1) {
      ov |= 1 << cb;
    }
    if (bits[cb] == 0) {
      av &= ~(1 << cb);
    }
    if (bits[cb] == 2) {
      xv |= (1 << cb);
    }
  }
  printf("3\n");
  printf("^ %d\n", xv);
  printf("| %d\n", ov);
  printf("& %d\n", av);
}
