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.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

/**
 * @author Don Li
 */
public class ShortProgram {
    void solve() {
        int n = in.nextInt();
        
        int[] and = new int[10], or = new int[10], xor = new int[10];
        Arrays.fill(and, 1);
        for (int i = 0; i < n; i++) {
            char op = in.nextToken().charAt(0);
            int x = in.nextInt();
            for (int j = 0; j < 10; j++) {
                if ((x & 1 << j) > 0) {
                    if (op == '&') {
                        continue;
                    } else if (op == '|') {
                        and[j] = 1;
                        or[j] = 1;
                        xor[j] = 0;
                    } else {
                        xor[j] ^= 1;
                    }
                } else {
                    if (op == '&') {
                        and[j] = 0;
                        or[j] = 0;
                        xor[j] = 0;
                    } else if (op == '|') {
                        continue;
                    } else {
                        continue;
                    }
                }
            }
        }
        
        out.println(3);
        int[] res = new int[3];
        for (int i = 0; i < 10; i++) {
            if (and[i] == 1) res[0] |= 1 << i;
            if (or[i] == 1) res[1] |= 1 << i;
            if (xor[i] == 1) res[2] |= 1 << i;
        }
        out.printf("& %d%n", res[0]);
        out.printf("| %d%n", res[1]);
        out.printf("^ %d%n", res[2]);
        
    }
    
    public static void main(String[] args) {
        in = new FastScanner(new BufferedReader(new InputStreamReader(System.in)));
        out = new PrintWriter(System.out);
        new ShortProgram().solve();
        out.close();
    }
    
    static FastScanner in;
    static PrintWriter out;
    
    static class FastScanner {
        BufferedReader in;
        StringTokenizer st;
        
        public FastScanner(BufferedReader in) {
            this.in = in;
        }
        
        public String nextToken() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(in.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
        
        public int nextInt() {
            return Integer.parseInt(nextToken());
        }
        
        public long nextLong() {
            return Long.parseLong(nextToken());
        }
        
        public double nextDouble() {
            return Double.parseDouble(nextToken());
        }
    }
}
