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;
const int N = 500005;
pair<char, int> arr[N];
int bits[10][2];
int main() {
  int n;
  scanf("%d%*c", &n);
  for (int i = 0; i < n; i++) {
    if (i == n - 1)
      scanf("%c %d", &arr[i].first, &arr[i].second);
    else
      scanf("%c %d%*c", &arr[i].first, &arr[i].second);
  }
  for (int i = 0; i < 10; i++) {
    for (int j = 0; j < 2; j++) {
      int curr = j;
      for (int k = 0; k < n; k++) {
        int currBit = (arr[k].second & (1 << i)) ? 1 : 0;
        if (arr[k].first == '^') {
          curr = curr ^ currBit;
        } else if (arr[k].first == '|') {
          curr = curr | currBit;
        } else {
          curr = curr & currBit;
        }
      }
      bits[i][j] = curr;
    }
  }
  int a[10], b[10], c[10];
  for (int i = 0; i < 10; i++) {
    if (!bits[i][0] && !bits[i][1]) {
      a[i] = 0;
      b[i] = 0;
      c[i] = 0;
    } else if (!bits[i][0] && bits[i][1]) {
      a[i] = 1;
      b[i] = 0;
      c[i] = 0;
    } else if (bits[i][0] && !bits[i][1]) {
      a[i] = 1;
      b[i] = 1;
      c[i] = 0;
    } else {
      a[i] = 1;
      b[i] = 0;
      c[i] = 1;
    }
  }
  int aa = 0, bb = 0, cc = 0;
  for (int i = 0; i < 10; i++)
    aa |= a[i] * (1 << i), bb |= b[i] * (1 << i), cc |= c[i] * (1 << i);
  printf("3\n");
  printf("& %d\n", aa);
  printf("^ %d\n", bb);
  printf("| %d", cc);
  return 0;
}
