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 + 69;
const int INF = 1e9;
int n, ans[10], mark[10];
void solve(char type, int val) {
  memset(mark, 0, sizeof mark);
  while (val != 0) {
    int lg = log2(val);
    mark[lg] = 1;
    val -= (1 << lg);
  }
  if (type == '^')
    for (int i = 0; i < 10; i++)
      if (mark[i]) {
        if (ans[i] == 0) ans[i] = 1;
        if (ans[i] == 1) ans[i] = 0;
        if (ans[i] == 2) ans[i] = 3;
        if (ans[i] == 3) ans[i] = 2;
      }
  if (type == '|')
    for (int i = 0; i < 10; i++)
      if (mark[i]) ans[i] = 1;
  if (type == '&')
    for (int i = 0; i < 10; i++)
      if (!mark[i]) ans[i] = 0;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  char type;
  int val, XOR = 0, OR = 0;
  cin >> n;
  for (int i = 0; i < 10; i++) ans[i] = 2;
  for (int i = 0; i < n; i++) cin >> type >> val, solve(type, val);
  for (int i = 0; i < 10; i++) {
    if (ans[i] == 0) OR += (1 << i), XOR += (1 << i);
    if (ans[i] == 1) OR += (1 << i);
    if (ans[i] == 3) XOR += (1 << i);
  }
  cout << 2 << "\n";
  cout << "| " << OR << "\n";
  cout << "^ " << XOR << "\n";
}
