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;
long long arr[100000];
long long arr1[600000][10];
void fill(long long* arr, long long n) {
  for (long long i = 0; i < n; i++) {
    long long num = arr[i];
    for (long long j = 9; j >= 0; j--) {
      arr1[i][j] = num % 2;
      num = num / 2;
    }
  }
}
long long getnum(long long arrr[]) {
  long long num = arrr[0];
  for (long long i = 1; i < 10; i++) {
    cout << arrr[i] << endl;
    num = num * 2 + arrr[i];
  }
  return num;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n;
  cin >> n;
  char s[n][3];
  long long a[n];
  for (long long i = 0; i < n; i++) cin >> s[i] >> a[i];
  fill(a, n);
  long long arr[10][2];
  for (long long i = 0; i < 10; i++) {
    arr[i][0] = 0;
    arr[i][1] = 1;
  }
  for (long long i = 0; i < 10; i++) {
    for (long long j = 0; j < n; j++) {
      if (s[j][0] == '^')
        arr[i][0] ^= arr1[j][i];
      else if (s[j][0] == '&')
        arr[i][0] &= arr1[j][i];
      else if (s[j][0] == '|')
        arr[i][0] |= arr1[j][i];
      if (s[j][0] == '^')
        arr[i][1] ^= arr1[j][i];
      else if (s[j][0] == '&')
        arr[i][1] &= arr1[j][i];
      if (s[j][0] == '|') arr[i][1] |= arr1[j][i];
    }
  }
  vector<long long> inv, sam, zer, one;
  for (long long i = 0; i < 10; i++) {
    if (arr[i][0] == 0 && arr[i][1] == 0)
      zer.push_back(i);
    else if (arr[i][0] == 1 && arr[i][1] == 1)
      one.push_back(i);
    else if (arr[i][0] == 0 && arr[i][1] == 1)
      sam.push_back(i);
    else
      inv.push_back(i);
  }
  cout << '3' << endl;
  cout << '&' << ' ';
  long long b[10];
  for (long long i = 0; i < 10; i++) b[i] = 1;
  for (long long i = 0; i < zer.size(); i++) {
    b[zer[i]] = 0;
  }
  long long num = b[0];
  for (long long i = 1; i < 10; i++) {
    num = num * 2 + b[i];
  }
  cout << num << endl;
  cout << '|' << ' ';
  for (long long i = 0; i < 10; i++) b[i] = 0;
  for (long long i = 0; i < one.size(); i++) b[one[i]] = 1;
  num = b[0];
  for (long long i = 1; i < 10; i++) {
    num = num * 2 + b[i];
  }
  cout << num << endl;
  cout << '^' << ' ';
  for (long long i = 0; i < 10; i++) b[i] = 0;
  for (long long i = 0; i < inv.size(); i++) b[inv[i]] = 1;
  num = b[0];
  for (long long i = 1; i < 10; i++) {
    num = num * 2 + b[i];
  }
  cout << num << endl;
}
