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>
const double pi = acos(-1.0);
using namespace std;
char a[500010];
int b[500010];
int yu[20], huo[20], yihuo[20];
int main() {
  int n;
  cin >> n;
  int c = 0, d = 1023;
  for (int i = 1; i <= n; i++) {
    getchar();
    scanf("%c%d", &a[i], &b[i]);
    if (a[i] == '&') {
      c &= b[i];
      d &= b[i];
    }
    if (a[i] == '|') {
      c |= b[i];
      d |= b[i];
    }
    if (a[i] == '^') {
      c ^= b[i];
      d ^= b[i];
    }
  }
  int cnt = 1;
  for (int i = 1; i <= 10; i++) {
    int cc = c % 2;
    int dd = d % 2;
    if (cc == 0 && dd == 0) {
      yu[cnt] = 0;
      yihuo[cnt] = 0;
      huo[cnt] = 0;
    }
    if (cc == 0 && dd == 1) {
      yu[cnt] = 1;
      yihuo[cnt] = 0;
      huo[cnt] = 0;
    }
    if (cc == 1 && dd == 0) {
      yu[cnt] = 1;
      yihuo[cnt] = 1;
      huo[cnt] = 0;
    }
    if (cc == 1 && dd == 1) {
      yu[cnt] = 1;
      yihuo[cnt] = 0;
      huo[cnt] = 1;
    }
    cnt++;
    c /= 2;
    d /= 2;
  }
  int ans1 = 0, ans2 = 0, ans3 = 0;
  for (int i = 0; i <= 9; i++) {
    ans1 += (pow(2, i) * yu[i]);
    ans2 += (pow(2, i) * yihuo[i]);
    ans3 += (pow(2, i) * huo[i]);
  }
  cout << "3" << endl;
  cout << "& " << ans1 << endl;
  cout << "^ " << ans2 << endl;
  cout << "| " << ans3 << endl;
  return 0;
}
