#include <bits/stdc++.h>
using namespace std;
const int maxn = 7e5 + 10;
vector<int> a[maxn];
vector<int> ans[5];
char s[maxn];
int vis[maxn];
int via[maxn];
int check(int u) {
  int res = 0;
  for (int i = ans[u].size() - 1; i >= 0; i--) {
    res = res * 2 + ans[u][i];
  }
  return res;
}
void judge(int x, int id) {
  while (x) {
    if (x & 1)
      a[id].push_back(1);
    else
      a[id].push_back(0);
    x >>= 1;
  }
}
int main() {
  int n;
  scanf("%d", &n);
  int flag = 0;
  int len = 0;
  int mark = 10;
  for (int i = 1; i <= n; i++) {
    int num;
    char ch;
    cin >> ch >> num;
    judge(num, i);
    s[i] = ch;
    int m = a[i].size();
    len = max(len, m);
    if (ch == '&') {
      flag = 1;
      mark = min(mark, m);
    }
  }
  for (int i = 1; i <= n; i++) {
    while (a[i].size() < len) a[i].push_back(0);
  }
  for (int i = 0; i < len; i++) {
    int res = 0;
    for (int k = 1; k <= n; k++) {
      if (s[k] == '^')
        res ^= a[k][i];
      else if (s[k] == '|')
        res |= a[k][i];
      else
        res &= a[k][i];
    }
    int rea = 1;
    for (int k = 1; k <= n; k++) {
      if (s[k] == '^')
        rea ^= a[k][i];
      else if (s[k] == '|')
        rea |= a[k][i];
      else
        rea &= a[k][i];
    }
    if (res == 0 && rea == 0) {
      ans[1].push_back(0);
      ans[2].push_back(0);
      ans[3].push_back(0);
    }
    if (res == 1 && rea == 1) {
      ans[1].push_back(1);
      ans[2].push_back(1);
      ans[3].push_back(0);
    }
    if (res == 0 && rea == 1) {
      ans[1].push_back(1);
      ans[2].push_back(0);
      ans[3].push_back(0);
    }
    if (res == 1 && rea == 0) {
      ans[1].push_back(1);
      ans[2].push_back(0);
      ans[3].push_back(1);
    }
  }
  while (ans[1].size() < mark) ans[1].push_back(1);
  printf("3\n");
  int num1 = check(1);
  int num2 = check(2);
  int num3 = check(3);
  printf("& %d\n", num1);
  printf("| %d\n", num2);
  printf("^ %d\n", num3);
  return 0;
}
