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 mod = 1e9 + 7;
long long modexp(long long x, long long n) {
  if (n == 0) return 1;
  if (n % 2 == 0) {
    long long y = modexp(x, n / 2) % mod;
    return (y * y) % mod;
  }
  return (x * modexp(x, n - 1) % mod) % mod;
}
vector<pair<char, int> > v;
int getans(char ch, int x, int y) {
  if (ch == '|')
    return x | y;
  else if (ch == '&')
    return x & y;
  else
    return x ^ y;
}
int main() {
  int n, x, y;
  scanf("%d", &n);
  char ch;
  int bits[10];
  for (int i = 0; i < 10; i++) bits[i] = 5;
  char prev = '$';
  for (int i = 0; i < n; i++) {
    cin >> ch;
    scanf("%d", &x);
    if (prev == ch) {
      v.pop_back();
      int u = getans(ch, x, y);
      v.push_back(make_pair(ch, u));
      y = u;
    } else {
      v.push_back(make_pair(ch, x));
      prev = ch;
      y = x;
    }
  }
  for (int i = 0; i < v.size(); i++) {
    int bin[10];
    int j = 9;
    int temp = v[i].second;
    ch = v[i].first;
    for (int k = 0; k < 10; k++) bin[k] = 0;
    while (temp) {
      bin[j--] = temp % 2;
      temp /= 2;
    }
    if (ch == '|') {
      for (j = 0; j < 10; j++) {
        if (bin[j] == 1) {
          bits[j] = 1;
        }
      }
    } else if (ch == '&') {
      for (j = 0; j < 10; j++) {
        if (bin[j] == 0) {
          bits[j] = 0;
        }
      }
    } else {
      for (j = 0; j < 10; j++) {
        if (bin[j] == 1) {
          if (bits[j] == 1) {
            bits[j] = 0;
          } else if (bits[j] == 0) {
            bits[j] = 1;
          } else
            bits[j] = 7;
        }
      }
    }
  }
  int ans[10];
  printf("3\n");
  for (int i = 0; i < 10; i++) {
    if (bits[i] == 0) {
      ans[i] = 0;
    } else if (bits[i] == 1)
      ans[i] = 1;
    else
      ans[i] = 0;
  }
  int ans1 = 0;
  for (int i = 0; i < 10; i++) {
    ans1 += ans[i] * pow(2, 10 - i - 1);
  }
  printf("| %d\n", ans1);
  for (int i = 0; i < 10; i++) {
    if (bits[i] == 0) {
      ans[i] = 0;
    } else
      ans[i] = 1;
  }
  ans1 = 0;
  for (int i = 0; i < 10; i++) {
    ans1 += ans[i] * pow(2, 10 - i - 1);
  }
  printf("& %d\n", ans1);
  for (int i = 0; i < 10; i++) {
    if (bits[i] == 0 || bits[i] == 1 || bits[i] == 5) {
      ans[i] = 0;
    } else
      ans[i] = 1;
  }
  ans1 = 0;
  for (int i = 0; i < 10; i++) {
    ans1 += ans[i] * pow(2, 10 - i - 1);
  }
  printf("^ %d", ans1);
  return 0;
}
