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 maxn = 5e5 + 50;
vector<int> v1;
vector<int> v2;
vector<int> v3;
struct Operator {
  char ch;
  int x;
} p[maxn];
bool vis[maxn];
int main() {
  int n;
  cin >> n;
  memset(vis, false, sizeof(vis));
  v1.clear();
  v2.clear();
  v3.clear();
  int f = 0;
  for (int i = 0; i < n; i++) {
    cin >> p[i].ch >> p[i].x;
    if (p[i].ch == '|') v1.push_back(i);
    if (p[i].ch == '&') v2.push_back(i);
    if (p[i].ch == '^') v3.push_back(i);
  }
  for (int i = 0; i < v1.size(); i++) {
    for (int j = i + 1; j < v1.size(); j++) {
      int one = p[v1[i]].x;
      int tow = p[v1[j]].x;
      if ((one | tow) == one) {
        f = 1;
        vis[v1[j]] = true;
      } else if ((one | tow) == tow) {
        f = 1;
        vis[v1[i]] = true;
      }
    }
  }
  for (int i = 0; i < v2.size(); i++) {
    for (int j = i + 1; j < v2.size(); j++) {
      int one = p[v2[i]].x;
      int tow = p[v2[j]].x;
      if ((one & tow) == one) {
        f = 1;
        vis[v2[j]] = true;
      } else if ((one & tow) == tow) {
        f = 1;
        vis[v2[i]] = true;
      }
    }
  }
  for (int i = 0; i < v3.size(); i++) {
    for (int j = i + 1; j < v3.size(); j++) {
      int one = p[v3[i]].x;
      int tow = p[v3[j]].x;
      if ((one ^ tow) == one) {
        f = 1;
        vis[v3[j]] = true;
      } else if ((one ^ tow) == tow) {
        f = 1;
        vis[v3[i]] = true;
      }
    }
  }
  int ans = 0;
  for (int i = 0; i < n; i++)
    if (!vis[i]) ans++;
  if (ans <= 5 && f) {
    cout << ans << endl;
    for (int i = 0; i < n; i++) {
      if (vis[i] == false) {
        cout << p[i].ch << " " << p[i].x << endl;
      }
    }
  } else
    cout << 0 << endl;
  return 0;
}
