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

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.PrintStream;
import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;

/*
 public class _879C {

 }

 */

public class _879C {
  enum state {
    same, zero, one, opp
  }

  public void solve() throws FileNotFoundException {
    InputStream inputStream = System.in;

    InputHelper inputHelper = new InputHelper(inputStream);

    PrintStream out = System.out;

    // actual solution
    int n = inputHelper.readInteger();

    state[] states = new state[10];

    for (int i = 0; i < 10; i++) {
      states[i] = state.same;
    }

    for (int i = 0; i < n; i++) {
      char c = inputHelper.read().charAt(0);
      int num = inputHelper.readInteger();

      for (int j = 0; j < 10; j++) {
        int cnum = (num & (1 << j));

        if (cnum != 0) {
          if (c == '|') {
            states[j] = state.one;
          }
          if (c == '^') {
            switch (states[j]) {
              case one:
                states[j] = state.zero;
                break;
              case opp:
                states[j] = state.same;
                break;
              case same:
                states[j] = state.opp;
                break;
              case zero:
                states[j] = state.one;
                break;
            }
          }
        } else {
          if (c == '&') {
            states[j] = state.zero;
          }
        }
      }
    }

    int and = 1023, or = 0, xor = 0;
    for (int i = 0; i < 10; i++) {
      if (states[i] == state.one) {
        or |= (1 << i);
      } else if (states[i] == state.zero) {
        and &= ~(1 << i);
      } else if (states[i] == state.opp) {
        xor |= (1 << i);
      }
    }

    System.out.println(3);

    System.out.println("| " + or);
    System.out.println("& " + and);
    System.out.println("^ " + xor);
    // end here
  }

  public static void main(String[] args) throws FileNotFoundException {
    (new _879C()).solve();
  }

  class InputHelper {
    StringTokenizer tokenizer = null;
    private BufferedReader bufferedReader;

    public InputHelper(InputStream inputStream) {
      InputStreamReader inputStreamReader = new InputStreamReader(inputStream);
      bufferedReader = new BufferedReader(inputStreamReader, 16384);
    }

    public String read() {
      while (tokenizer == null || !tokenizer.hasMoreTokens()) {
        try {
          String line = bufferedReader.readLine();
          if (line == null) {
            return null;
          }
          tokenizer = new StringTokenizer(line);
        } catch (IOException e) {
          e.printStackTrace();
        }
      }

      return tokenizer.nextToken();
    }

    public Integer readInteger() {
      return Integer.parseInt(read());
    }

    public Long readLong() {
      return Long.parseLong(read());
    }
  }
}
