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.io.FilterInputStream;
import java.io.BufferedInputStream;
import java.io.InputStream;

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

    static class CShortProgram {
        public void solve(int testNumber, ScanReader in, PrintWriter out) {


            int and = (1 << 10) - 1;
            int or = 0;
            int xor = 0;


            int n = in.scanInt();
            int arr[][] = new int[n][2];
            for (int i = 0; i < n; i++) {
                char cc = in.scanChar();
                if (cc == '&') arr[i][0] = 0;
                else if (cc == '|') arr[i][0] = 1;
                else arr[i][0] = 2;

                arr[i][1] = in.scanInt();
            }

            for (int i = 0; i < 10; i++) {
                int ans[] = new int[2];
                for (int k = 0; k < 2; k++) {
                    int bit = k;
                    for (int j = 0; j < n; j++) {
                        int cc = ((arr[j][1] & (1 << i)) != 0) ? 1 : 0;
                        if (arr[j][0] == 0) bit &= cc;
                        else if (arr[j][0] == 1) bit |= cc;
                        else bit ^= cc;
                    }
                    ans[k] = bit;
                }

                if (ans[0] == 0 && ans[1] == 0) and ^= (1 << i);
                else if (ans[0] == 1 && ans[1] == 1) or ^= (1 << i);
                else if (ans[0] == 1 && ans[1] == 0) xor ^= (1 << i);
            }

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

        }

    }

    static class ScanReader {
        private byte[] buf = new byte[4 * 1024];
        private int INDEX;
        private BufferedInputStream in;
        private int TOTAL;

        public ScanReader(InputStream inputStream) {
            in = new BufferedInputStream(inputStream);
        }

        private int scan() {
            if (INDEX >= TOTAL) {
                INDEX = 0;
                try {
                    TOTAL = in.read(buf);
                } catch (Exception e) {
                    e.printStackTrace();
                }
                if (TOTAL <= 0) return -1;
            }
            return buf[INDEX++];
        }

        public char scanChar() {
            int c = scan();
            while (isWhiteSpace(c)) c = scan();
            return (char) c;
        }

        public int scanInt() {
            int I = 0;
            int n = scan();
            while (isWhiteSpace(n)) n = scan();
            int neg = 1;
            if (n == '-') {
                neg = -1;
                n = scan();
            }
            while (!isWhiteSpace(n)) {
                if (n >= '0' && n <= '9') {
                    I *= 10;
                    I += n - '0';
                    n = scan();
                }
            }
            return neg * I;
        }

        private boolean isWhiteSpace(int n) {
            if (n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1) return true;
            else return false;
        }

    }
}

