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;
void solve() {
  int n;
  cin >> n;
  vector<char> ops(n);
  vector<int> vals(n);
  for (int i = 0; i < n; i++) {
    cin >> ops[i] >> vals[i];
  }
  int mx = pow(2, 12) - 1, mn = 0;
  for (int i = 0; i < n; i++) {
    if (ops[i] == '|') {
      mx |= vals[i];
      mn |= vals[i];
    } else if (ops[i] == '&') {
      mx &= vals[i];
      mn &= vals[i];
    } else {
      mx ^= vals[i];
      mn ^= vals[i];
    }
  }
  int and_val = 0, or_val = 0, xor_val = 0;
  for (int i = 0; i < 11; i++) {
    if ((mx & (1 << i)) && (mn & (1 << i)) == 0) {
      and_val |= (1 << i);
      continue;
    }
    if ((mx & (1 << i)) && (mn & (1 << i))) {
      or_val |= (1 << i);
    } else if ((mx & (1 << i)) == 0 && (mn & (1 << i))) {
      or_val |= (1 << i);
    }
  }
  cout << 3 << endl;
  cout << '& ' << and_val << endl;
  cout << '| ' << or_val << endl;
  cout << '^ ' << xor_val << endl;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
}
