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 double eps = 0.000000000000001;
string convertstring(long long n) {
  stringstream ss;
  ss << n;
  return ss.str();
}
int a[11][2];
bool bit(int a, int in) {
  if (a & (1 << in)) return 1;
  return 0;
}
int main() {
  int n, k, i, j;
  scanf("%d", &n);
  ;
  for (i = 0; i < 10; ++i)
    for (j = 0; j < 2; ++j) a[i][j] = j;
  getchar();
  for (i = 0; i < n; ++i) {
    char c, s[3];
    int x;
    scanf("%s%d", s, &x);
    c = s[0];
    for (j = 0; j < 10; ++j)
      for (k = 0; k < 2; ++k) {
        if (c == '|')
          a[j][k] |= (bit(x, j));
        else if (c == '&')
          a[j][k] &= (bit(x, j));
        else if (c == '^')
          a[j][k] ^= (bit(x, j));
      }
  }
  int ann = 0, orr = 0, xrr = 0;
  for (i = 0; i < 10; ++i) {
    if (!a[i][0] && !a[i][1]) {
    } else if (a[i][0] && a[i][1]) {
      orr |= (1 << i);
      ann |= (1 << i);
    } else if (a[i][0] && !a[i][1]) {
      xrr |= (1 << i);
      ann |= (1 << i);
    } else
      ann |= (1 << i);
  }
  printf("3\n& %d\n| %d\n^ %d\n", ann, orr, xrr);
  return 0;
}
