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

public class C {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        Integer n = Integer.parseInt(br.readLine());

        Map<Long, Integer> map = new TreeMap<>();
        boolean[] excluded = new boolean[n];

        int[] temp = new int[10];
        for(int i = 0; i < 10; i++) {
            // meaning undefined
            temp[i] = 2;
        }

        long tt = 0;
        long mu = 1;
        for(int j = 9; j >= 0; j--) {
            tt += temp[j] * mu;
            mu *= 10;
        }
        map.put(tt, -1);

        String[] ops = new String[n];
        for(int i = 0; i < n; i++) {
            String op = br.readLine();
            ops[i] = op;

            String s[] = op.split(" ");
            Integer val = Integer.parseInt(s[1]);

            int[] cur = new int[10];

            if(s[0].equals("&")) {
                for(int j = 9; j >= 0; j--) {
                    if((val & 1) == 0) {
                        cur[j] = 0;
                    }
                    else if(temp[j] != 2) {
                        cur[j] = (val & 1) & temp[j];
                    } else {
                        cur[j] = 2;
                    }
                    val >>= 1;
                }
            } else if(s[0].equals("|")) {
                for(int j = 9; j >= 0; j--) {
                    if((val & 1) == 1) {
                        cur[j] = 1;
                    }
                    else if(temp[j] != 2) {
                        cur[j] = (val & 1) | temp[j];
                    } else {
                        cur[j] = 2;
                    }
                    val >>= 1;
                }
            } else if(s[0].equals("^")) {
                for(int j = 9; j >= 0; j--) {
                    if(temp[j] != 2) {
                        cur[j] = (val & 1) ^ temp[j];
                    } else {
                        cur[j] = 2;
                    }
                    val >>= 1;
                }
            }
            temp = cur;
            long toMap = 0;
            long mult = 1;
            for(int j = 9; j >= 0; j--) {
                toMap += temp[j] * mult;
                mult *= 10;
            }

            if(!map.containsKey(toMap)) {
                map.put(toMap, i);
            } else {
                int index = map.get(toMap);
                for(int j = index + 1; j <= i; j++) {
                    excluded[j] = true;
                }
                map.put(toMap, i);
            }
        }

        int counter = 0;
        for(int i = 0; i < n; i++) {
            if(!excluded[i]) {
                counter++;
            }
        }

        System.out.println(counter);
        for(int i = 0; i < n; i++) {
            if(!excluded[i]) {
                System.out.println(ops[i]);
            }
        }
    }
}
