Petya learned a new programming language CALPAS. A program in this language always takes one non-negative integer and returns one non-negative integer as well.

In the language, there are only three commands: apply a bitwise operation AND, OR or XOR with a given constant to the current integer. A program can contain an arbitrary sequence of these operations with arbitrary constants from 0 to 1023. When the program is run, all operations are applied (in the given order) to the argument and in the end the result integer is returned.

Petya wrote a program in this language, but it turned out to be too long. Write a program in CALPAS that does the same thing as the Petya's program, and consists of no more than 5 lines. Your program should return the same integer as Petya's program for all arguments from 0 to 1023.

Input

The first line contains an integer n (1 ≤ n ≤ 5·105) — the number of lines.

Next n lines contain commands. A command consists of a character that represents the operation ("&", "|" or "^" for AND, OR or XOR respectively), and the constant xi 0 ≤ xi ≤ 1023.

Output

Output an integer k (0 ≤ k ≤ 5) — the length of your program.

Next k lines must contain commands in the same format as in the input.

Examples

Input

3
| 3
^ 2
| 1


Output

2
| 3
^ 2


Input

3
&amp; 1
&amp; 3
&amp; 5


Output

1
&amp; 1


Input

3
^ 1
^ 2
^ 3


Output

0

Note

You can read about bitwise operations in <https://en.wikipedia.org/wiki/Bitwise_operation>.

Second sample:

Let x be an input of the Petya's program. It's output is ((x&1)&3)&5 = x&(1&3&5) = x&1. So these two programs always give the same outputs.
import java.io.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.*;
import java.io.IOException;
import java.io.InputStream;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
import java.util.stream.Collector;
import java.util.stream.Collectors;
import java.util.stream.IntStream;

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

        File file = new File("in.txt");
        File fileOut = new File("out.txt");
        InputStream inputStream = null;
        OutputStream outputStream = null;
        // try {inputStream= new FileInputStream(file);} catch (FileNotFoundException ex){return;};
//        try {outputStream= new FileOutputStream(fileOut);} catch (FileNotFoundException ex){return;};
        inputStream = System.in;
        outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(1, in, out);
        out.close();
    }


}

class Task {

    List<Integer> opVals;
    List<Character> op;
    public void solve(int testNumber, InputReader in, PrintWriter out) {
        Integer n = in.nextInt();
        opVals = new ArrayList<>(n);
        op = new ArrayList<>(n);
        for(int i=0; i<n; i++){
            op.add(in.next().charAt(0));
            opVals.add(in.nextInt());
        }

        Set<Integer> alwaysZero = new HashSet<>();
        Set<Integer> alwaysOne = new HashSet<>();
        Set<Integer> flip = new HashSet<>();
        for(int i=0; i<10; i++){
            Boolean evalZero = evaluateBit(false, i);
            Boolean evalOne = evaluateBit(true, i);
            if(!evalZero && !evalOne){
                alwaysZero.add(i);
            }
            else if(evalZero && evalOne){
                alwaysOne.add(i);
            }
            else if(evalZero && !evalOne){
                flip.add(i);
            }
        }

        Set<Integer> complAlwaysZero = new HashSet<>();
        for(int i=0; i<10; i++){
            if(!alwaysZero.contains(i)){
                complAlwaysZero.add(i);
            }
        }
        out.println(3);
        out.println("& " + formNumber(complAlwaysZero));
        out.println("| " + formNumber(alwaysOne));
        out.println("^ " + formNumber(flip));



//        out.println("Zero: " + alwaysZero);
//        out.println("One "  + alwaysOne);
//        out.println("Flip: " + flip);
    }

    public Integer formNumber(Set<Integer> bitSet){
        Integer val = 0;
        for(Integer i : bitSet){
            Integer v = 1 << i;
            val += v;
        }
        return val;
    }

    public Boolean evaluateBit(Boolean bitVal, Integer bit){
        Integer val = 0;
        if(bitVal) {
            val = 1 << bit;
        }

        for(int i=0; i<op.size(); i++){
            Character o = op.get(i);
            Integer v = opVals.get(i);
            if(o == '|'){
                val = val | v;
            }
            else if(o == '^'){
                val = val ^ v;
            }
            else if (o == '&'){
                val = val & v;
            }
        }

        return (val & (1<<bit)) > 0;

    }




}



class InputReader {
    public BufferedReader reader;
    public StringTokenizer tokenizer;

    public InputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream), 32768);
        tokenizer = null;
    }

    public String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public String nextLine(){
        try {
            return reader.readLine();
        } catch (IOException e){
            throw new RuntimeException(e);
        }
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }
    public long nextLong() { return Long.parseLong(next()); }

}



class Pair<F, S> {
    public final F first;
    public final S second;




    public Pair(F first, S second) {
        this.first = first;
        this.second = second;
    }

    @Override
    public boolean equals(Object o) {
        if (!(o instanceof Pair)) {
            return false;
        }
        Pair<?, ?> p = (Pair<?, ?>) o;
        return Objects.equals(p.first, first) && Objects.equals(p.second, second);
    }

    @Override
    public int hashCode() {
        return (first == null ? 0 : first.hashCode()) ^ (second == null ? 0 : second.hashCode());
    }

    @Override
    public String toString() {
        return "(" + first + ", " + second + ')';
    }
}

class IntPair extends Pair<Integer, Integer>{
    public IntPair(Integer first, Integer second){
        super(first, second);
    }
}