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;
using ll = long long;
using ull = unsigned long long;
constexpr int MOD = 1e9 + 7;
constexpr int MAXN = 1e6 + 8;
int N, M, K, Q;
char op[MAXN];
int x[MAXN];
int ans[3];
void preprocess() {}
void solution() {
  int zeros = 0, ones = 1023;
  for (int i = 0; i < N; ++i) {
    switch (op[i]) {
      case '|':
        zeros |= x[i], ones |= x[i];
        break;
      case '&':
        zeros &= x[i], ones &= x[i];
        break;
      case '^':
        zeros ^= x[i], ones ^= x[i];
        break;
    }
  }
  ans[0] = ones | zeros;
  ans[1] = ones & zeros;
  ans[2] = (ones ^ zeros) & zeros;
}
int main() {
  cin >> N;
  for (int i = 0; i < N; ++i) cin >> op[i] >> x[i];
  solution();
  cout << "3\n";
  cout << "& " << ans[0] << '\n';
  cout << "| " << ans[1] << '\n';
  cout << "^ " << ans[2] << '\n';
  return 0;
}
