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 one[15], zero[15], digits[15];
int main() {
  int number, digit, andn, orn, xorn, n;
  char command;
  while (~scanf("%d", &n)) {
    for (int i = 0; i < 10; i++) {
      zero[i] = 0;
      one[i] = 1;
    }
    for (int i = 0; i < n; i++) {
      getchar();
      scanf("%c %d", &command, &number);
      digit = 0;
      while (number) {
        digits[digit++] = number % 2;
        number /= 2;
      }
      switch (command) {
        case '&':
          for (int i = 0; i < 10; i++) {
            zero[i] &= digits[i];
            one[i] &= digits[i];
          }
          break;
        case '|':
          for (int i = 0; i < 10; i++) {
            zero[i] |= digits[i];
            one[i] |= digits[i];
          }
          break;
        case '^':
          for (int i = 0; i < 10; i++) {
            zero[i] ^= digits[i];
            one[i] ^= digits[i];
          }
          break;
      }
    }
    andn = orn = xorn = 0;
    for (int i = 0; i < 10; i++) {
      if (one[i] == 1 && zero[i] == 0) {
        andn += (1 << i);
      } else if (zero[i] == one[i] && zero[i] == 1) {
        orn += (1 << i);
        andn += (1 << i);
      } else if (zero[i] == one[i] && zero[i] == 0) {
        orn += (1 << i);
      } else {
        andn += (1 << i);
        xorn += (1 << i);
      }
    }
    printf("3\n| %d\n& %d\n^ %d\n", orn, andn, xorn);
  }
  return 0;
}
