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.*;
import java.util.*;

public class C {
    FScanner in = new FScanner();
    PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out), true);

    void run() {
        int n = Integer.parseInt(in.nextLine());
        String[] as = new String[n];
        char[] ops = new char[n];
        int[] num = new int[n];
        for (int i = 0; i < n; i++) {
            as[i] = in.nextLine();
            ops[i] = as[i].charAt(0);
            num[i] = Integer.parseInt(as[i].substring(2));
        }
        int start1 = 0;
        int start2 = 1023;
        for (int i = 0; i < n; i++) {
            if (ops[i] == '^') {
                start1 ^= num[i];
            } else if (ops[i] == '|') {
                start1 |= num[i];
            } else if (ops[i] == '&') {
                start1 &= num[i];
            }
        }
        for (int i = 0; i < n; i++) {
            if (ops[i] == '^') {
                start2 ^= num[i];
            } else if (ops[i] == '|') {
                start2 |= num[i];
            } else if (ops[i] == '&') {
                start2 &= num[i];
            }
        }
        int xor = 0, and = 0, or = 1023;
        for (int i = 0; i < 10; i++) {
            if (((start1 >> i) & 1) != 0 && ((start2 >> i) & 1) == 0) {
                xor += 1 << i;
            } else if (((start1 >> i) & 1) == 0 && ((start2 >> i) & 1) == 0) {
                or -= 1 << i;
            } else if (((start1 >> i) & 1) != 0 && ((start2 >> i) & 1) != 0) {
                and += 1 << i;
            }
        }
        out.printf("%d \n", 3);
        out.printf("^ %d \n", xor);
        out.printf("& %d \n", or);
        out.printf("| %d \n", and);
        out.close();
    }

    public static void main(String[] args) {
        new C().run();
    }

    static class FScanner {
        BufferedReader br;
        StringTokenizer st;

        FScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }


        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

        char[][] nextCharArray(int n, int m) {
            char[][] g = new char[n][m];
            for (int i = 0; i < n; i++)
                g[i] = next().toCharArray();
            return g;
        }

        double[] nextDoubleArray(int n) {
            double[] a = new double[n];
            for (int i = 0; i < n; i++)
                a[i] = nextDouble();
            return a;
        }

        int[] nextIntArray(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++)
                a[i] = nextInt();
            return a;
        }

        long[] nextLongArray(int n) {
            long[] a = new long[n];
            for (int i = 0; i < n; i++)
                a[i] = nextLong();
            return a;
        }
    }
}