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 inf = 1 << 30;
const long long INF = 1ll << 60;
const double Inf = 1e20;
const double eps = 1e-9;
void gmax(int &a, int b) { a = (a > b ? a : b); }
void gmin(int &a, int b) { a = (a < b ? a : b); }
const int maxn = 500050;
char op[maxn][2];
int constant[maxn];
int n, final[10], x, y;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%s%d", op[i], &constant[i]);
  for (int i = 0; i <= 9; ++i) {
    x = 0;
    y = (1 << i);
    for (int i = 1; i <= n; ++i) {
      if (op[i][0] == '|') {
        x |= constant[i];
        y |= constant[i];
      }
      if (op[i][0] == '&') {
        x &= constant[i];
        y &= constant[i];
      }
      if (op[i][0] == '^') {
        x ^= constant[i];
        y ^= constant[i];
      }
    }
    x &= (1 << i);
    y &= (1 << i);
    if (x != 0 && y != 0)
      final[i] = 1;
    else if (x == 0 && y == 0)
      final[i] = 2;
    else if (x != 0 && y == 0)
      final[i] = 3;
    else
      final[i] = 4;
  }
  printf("3\n");
  int x = (1 << 10) - 1;
  for (int i = 0; i <= 9; ++i)
    if (final[i] == 2) x -= (1 << i);
  printf("& %d\n", x);
  x = 0;
  for (int i = 0; i <= 9; ++i)
    if (final[i] == 3) x += (1 << i);
  x = 0;
  printf("^ %d\n", x);
  x = 0;
  for (int i = 0; i <= 9; ++i)
    if (final[i] == 1) x += (1 << i);
  printf("| %d\n", x);
  return 0;
}
