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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Aeroui
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();

            int[] bits = new int[15];
            int[] xx = new int[15];
            Arrays.fill(bits, -1);
            for (int i = 0; i < n; ++i) {
                char op = in.next().charAt(0);
                int val = in.nextInt();

                if (op == '&') {
                    for (int j = 0; j < 10; ++j) {
                        if (((1 << j) & val) == 0)
                            bits[j] = 0;
                    }
                } else if (op == '|') {
                    for (int j = 0; j < 10; ++j) {
                        if (((1 << j) & val) == 1)
                            bits[j] = 1;
                    }
                } else {
                    for (int j = 0; j < 10; ++j) {
                        if (bits[j] >= 0) {
                            bits[j] = (bits[j] != ((1 << j) & val)) ? 1 : 0;
                        } else {
                            ++xx[j];
                            xx[j] = xx[j] & 1;
                        }
                    }
                }
            }


            int or = 0;
            int xor = 0;
            int and = 0;


            for (int i = 0; i < 10; ++i) {
                if (bits[i] < 0) {
                    and |= (1 << i);
                    if (xx[i] == 1) {
                        xor |= (1 << i);
                    }
                }

                if (bits[i] == 1) {
                    or |= (1 << i);
                }
            }

            if (or == 0 && and == 1023 && xor == 1023) {
                out.println("0");
                return;
            }

            if (and == 1 && xor == 0 && or == 0) {
                out.println("1");
                out.println("& 1");

                return;
            }

            out.println(3);
            out.println("& " + and);
            out.println("| " + or);
            out.println("^ " + xor);
        }

    }
}

