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;
int n;
int x[512345];
char c[512345];
int d[5][20];
vector<int> And;
vector<int> Or;
vector<int> Xor;
int t;
int num;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> c[i] >> x[i];
  for (int k = 0; k <= 9; k++) {
    int ans = 1 << k;
    for (int i = 1; i <= n; i++) {
      if (c[i] == '&') ans &= x[i];
      if (c[i] == '|') ans |= x[i];
      if (c[i] == '^') ans ^= x[i];
    }
    d[1][k] = (ans >> k) & 1;
  }
  for (int k = 0; k <= 9; k++) {
    int ans = 0;
    for (int i = 1; i <= n; i++) {
      if (c[i] == '&') ans &= x[i];
      if (c[i] == '|') ans |= x[i];
      if (c[i] == '^') ans ^= x[i];
    }
    d[0][k] = (ans >> k) & 1;
  }
  for (int k = 0; k <= 9; k++) {
    if (d[0][k] == 1 && d[1][k] == 0)
      Xor.push_back(k);
    else if (d[0][k] == 1)
      Or.push_back(k);
    else if (d[1][k] == 0)
      And.push_back(k);
  }
  t = !Or.empty() + !Xor.empty() + !And.empty();
  cout << t << '\n';
  num = 0;
  if (!Or.empty()) {
    for (auto i : Or) num += 1 << i;
    cout << '|' << ' ' << num << '\n';
  }
  num = 0;
  if (!And.empty()) {
    for (auto i : And) num += 1 << i;
    num = 1023 - num;
    cout << '&' << ' ' << num << '\n';
  }
  num = 0;
  if (!Xor.empty()) {
    for (auto i : Xor) num += 1 << i;
    cout << '^' << ' ' << num << '\n';
  }
  return 0;
}
