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

public class Main {
    public static void main(String[] args) {

        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        in.nextLine();

        int end = -1;
        Map<Integer, Integer> map = new HashMap<>();
        String[] ops = new String[n];
        int[] hashes = new int[n];
        Integer[] arr = new Integer[11];
        arr[0] = 0;
        for (int i = 1; i < 11; i++) {
            arr[i] = 1 << i - 1;
        }
        int hash = Arrays.deepHashCode(arr);
        map.put(hash, -1);
        boolean eq = false;
        for (int i = 0; i < n; i++) {
            String str = in.nextLine();
            ops[i] = str;
            if (str.equals("| 0")) continue;
            char op = str.split(" ")[0].charAt(0);
            int num = Integer.valueOf(str.split(" ")[1]);
            boolean equals = true;
            if (op == '|') {
                arr[0] |= num;
                int v = arr[0];
                for (int j = 1; j < 11; j++) {
                    arr[j] |= num;
                    equals &= arr[j] == v;
                    v = arr[j];
                }
            } else if (op == '^') {
                arr[0] ^= num;
                int v = arr[0];
                for (int j = 1; j < 11; j++) {
                    arr[j] ^= num;
                    equals &= arr[j] == v;
                    v = arr[j];
                }
            } else {
                arr[0] &= num;
                int v = arr[0];
                for (int j = 1; j < 11; j++) {
                    arr[j] &= num;
                    equals &= arr[j] == v;
                    v = arr[j];
                }
            }

            if (equals || eq) {
                eq = true;
                continue;
            }

            hash = Arrays.deepHashCode(arr);
            if (map.containsKey(hash)) {
                int start = map.get(hash);
                if (start == -1) {
                    map.clear();
                    for (int j = 1; j < 11; j++) {
                        arr[j] = 1 << j - 1;
                    }
                    map.put(Arrays.deepHashCode(arr), -1);
                    end = -1;
                    continue;
                }
                for (int j = start + 1; j <= end; j++) {
                    map.remove(hashes[j]);
                }
                end = start;
            } else {
                end++;
                map.put(hash, end);
                hashes[end] = hash;
            }

        }

        if (eq) {
            System.out.println("& 0");
            System.out.println("| " + arr[1]);
        } else {
            System.out.println(end + 1);
            for (int i = 0; i <= end; i++) {
                System.out.println(ops[i]);
            }
        }
    }
}