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;
int n, bt[500010][12], ans[15][5], res[10];
char op[500010];
int main() {
  scanf("%d", &n);
  for (int i = 1; i < n + 1; i++) {
    char s[2];
    scanf("%s", s);
    op[i] = s[0];
    int num;
    scanf("%d", &num);
    for (int j = 0; j < 9 + 1; j++) {
      if (num & 1)
        bt[i][j] = 1;
      else
        bt[i][j] = 0;
      num /= 2;
    }
  }
  for (int i = 1; i < n + 1; i++) {
    for (int j = 0; j < 9 + 1; j++) {
      if (op[i] == '&') {
        if (bt[i][j] == 0) {
          ans[j][0] = 1;
          for (int k = 1; k < 3 + 1; k++) ans[j][k] = 0;
        }
      } else if (op[i] == '|') {
        if (bt[i][j] == 1) {
          ans[j][1] = 1;
          ans[j][0] = ans[j][2] = ans[j][3] = 0;
        }
      } else {
        if (bt[i][j] == 1) {
          if (ans[j][0] || ans[j][1])
            swap(ans[j][0], ans[j][1]);
          else
            ans[j][3] ^= 1;
        }
      }
    }
  }
  for (int i = 0; i < 9 + 1; i++) {
    if (ans[i][0])
      ;
    else
      res[0] |= (1 << i);
    if (ans[i][1]) res[1] |= (1 << i);
    if (ans[i][3]) res[3] |= (1 << i);
  }
  printf("3\n");
  printf("& %d\n", res[0]);
  printf("| %d\n", res[1]);
  printf("^ %d", res[3]);
  return 0;
}
