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 MAX = 40000000;
vector<int> v[3];
vector<pair<string, int> > ordem;
vector<pair<string, int> > ans;
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    string s;
    int x;
    cin >> s >> x;
    ordem.push_back(make_pair(s, x));
    if (s == "&") {
      v[0].push_back(x);
    } else if (s == "|") {
      v[1].push_back(x);
    } else {
      v[2].push_back(x);
    }
  }
  int maxi = -1;
  for (int i = 0; i < v[1].size(); i++) maxi = max(v[1][i], maxi);
  int andi, xori;
  if (v[0].size() > 0) {
    andi = v[0][0];
    for (int i = 0; i < v[0].size(); i++) andi &= v[0][i];
  }
  if (v[2].size() > 0) {
    xori = v[2][0];
    for (int i = 1; i < v[2].size(); i++) xori ^= v[2][i];
  }
  bool used1 = false, used2 = false, used3 = false;
  for (int i = 0; i < n; i++) {
    string s = ordem[i].first;
    int x = ordem[i].second;
    if (s == "&" and !used1) {
      used1 = true;
      ans.push_back(make_pair(s, andi));
    } else if (s == "|" and !used2) {
      used2 = true;
      ans.push_back(make_pair(s, maxi));
    } else if (s == "^" and !used3) {
      used3 = true;
      ans.push_back(make_pair(s, xori));
    }
  }
  if (ans.size() == 1 and ans[0].second == 0) {
    if ((ans[0].first == "&") or (ans[0].first == "|")) {
      puts("0");
      return 0;
    }
  }
  printf("%d\n", ans.size());
  for (int i = 0; i < ans.size(); i++) {
    cout << ans[i].first << " " << ans[i].second << endl;
  }
  return 0;
}
