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 int N = 10;
int v[N];
char used[N];
int main() {
  memset(v, -1, sizeof v);
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    while (getchar() != '\n')
      ;
    char type;
    int x;
    scanf("%c %d", &type, &x);
    if (type == '&') {
      for (int j = 0; j < N; ++j)
        if (!(x & (1 << j))) v[j] = 0;
    } else if (type == '|') {
      for (int j = 0; j < N; ++j)
        if (x & (1 << j)) v[j] = 1;
    } else if (type == '^') {
      for (int j = 0; j < N; ++j)
        if (x & (1 << j)) {
          if (v[j] == -1)
            v[j] = 2;
          else if (v[j] == 0)
            v[j] = 1;
          else if (v[j] == 1)
            v[j] = 0;
          else if (v[j] == 2)
            v[j] = -1;
        }
    }
  }
  int ans1 = 0, ans2 = 0, ans3 = 0;
  for (int i = 0; i < N; ++i) {
    if (v[i] != 0) ans1 += (1 << i);
    if (v[i] == 1) ans2 += (1 << i);
    if (v[i] == 2) ans3 += (1 << i);
  }
  return !printf("3\n& %d\n| %d\n^ %d\n", ans1, ans2, ans3);
}
