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>
const int N = 500 * 1000, of_bits = 10;
int n, where_set[of_bits], consts[N], one, two, three;
char str[20], op[N], one_xor[of_bits], val[of_bits];
int main() {
  std::scanf("%d", &n);
  for (int i = 0; i < of_bits; i++) val[i] = -1;
  for (int i = 0; i < n; i++) {
    std::scanf("%s%d", str, &consts[i]);
    op[i] = str[0];
  }
  for (int i = n - 1; i >= 0; i--) {
    if (op[i] == '&') {
      for (int j = 0; j < of_bits; j++)
        if (val[j] == -1 && !((1 << j) & consts[i])) val[j] = one_xor[j];
    } else if (op[i] == '|') {
      for (int j = 0; j < of_bits; j++)
        if (val[j] == -1 && ((1 << j) & consts[i]))
          val[j] = (one_xor[j] + 1) % 2;
    } else {
      for (int j = 0; j < of_bits; j++)
        if (val[j] == -1 && ((1 << j) & consts[i]))
          one_xor[j] = (one_xor[j] + 1) % 2;
    }
  }
  for (int j = 0; j < of_bits; j++)
    if (val[j] == 1) one |= (1 << j);
  for (int j = 0; j < of_bits; j++)
    if (val[j] != 0) two |= (1 << j);
  for (int j = 0; j < of_bits; j++)
    if (val[j] == -1 && one_xor[j]) three |= (1 << j);
  std::printf("3\n");
  std::printf("| %d\n", one);
  std::printf("& %d\n", two);
  std::printf("^ %d\n", three);
  return 0;
}
