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 maxn = 5e5 + 10;
char s[maxn], a[maxn];
int trans[10][2];
int _xor[10], _or[10], _and[10];
int main() {
  int n;
  scanf("%d", &n);
  getchar();
  for (int i = 0; i < 10; i++) _and[i] = 1;
  for (int i = 0; i < n; i++) scanf("%c%d", &s[i], &a[i]), getchar();
  for (int i = 0; i < 10; i++) trans[i][0] = 0, trans[i][1] = 1;
  for (int i = 0; i < 2; i++) {
    for (int j = 0; j < 10; j++) {
      for (int k = 0; k < n; k++) {
        if (s[k] == '|')
          trans[j][i] |= (a[k] & (1 << j));
        else if (s[k] == '&')
          trans[j][i] &= (a[k] & (1 << j));
        else if (s[k] == '^')
          trans[j][i] &= (a[k] & (1 << j));
      }
    }
  }
  for (int i = 0; i < 10; i++) {
    if (trans[i][0] == 1 && trans[i][0] == 1) _or[i] = 1;
    if (trans[i][0] == 0 && trans[i][0] == 0)
      _and[i] = 1;
    else
      _xor[i] = 1;
  }
  int num = 0;
  for (int i = 0; i < 10; i++) {
    num += _or[i] ? (1 << i) : 0;
  }
  printf("| %d\n", num);
  num = 0;
  for (int i = 0; i < 10; i++) {
    num += _and[i] ? (1 << i) : 0;
  }
  printf("& %d\n", num);
  num = 0;
  for (int i = 0; i < 10; i++) {
    num += _xor[i] ? (1 << i) : 0;
  }
  printf("^ %d\n", num);
  return 0;
}
