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 bits[10];
int main() {
  int n, x;
  char c;
  scanf("%d\n", &n);
  memset(bits, -1, sizeof bits);
  for (int i = 0; i < n; i++) {
    scanf("%c %d\n", &c, &x);
    if (c == '&') {
      for (int j = 0; j < 10; j++) {
        if (x & (1 << j)) continue;
        bits[j] = 0;
      }
    } else if (c == '|') {
      for (int j = 0; j < 10; j++) {
        if (x & (1 << j)) {
          bits[j] = 1;
        }
      }
    } else {
      for (int j = 0; j < 10; j++) {
        if (x & (1 << j)) {
          if (bits[j] == 0)
            bits[j] = 1;
          else if (bits[j] == 1)
            bits[j] = 0;
          else if (bits[j] == -1)
            bits[j] = -2;
          else
            bits[j] = -1;
        }
      }
    }
  }
  int and_ans, or_ans, xor_ans;
  and_ans = (1 << 10) - 1;
  or_ans = 0;
  xor_ans = 0;
  for (int i = 0; i < 10; i++) {
    if (bits[i] == 1)
      or_ans |= (1 << i);
    else if (bits[i] == 0)
      and_ans &= ~(1 << i);
    else if (bits[i] == -2)
      xor_ans |= (1 << i);
  }
  printf("3\n");
  printf("& %d\n", and_ans);
  printf("| %d\n", or_ans);
  printf("^ %d\n", xor_ans);
  return 0;
}
