CF 878A SHORT PROGRAM

A. Short Program

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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·10⁵) — 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 x_i 0 ≤ x_i ≤ 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
& 1
& 3
& 5

output

1
& 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.

#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <cassert>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
const ll mod=1000000007;

// head

int n,x,mask,bit,bit2,b1,b2,b3;
char op[10];
int main() {
	scanf("%d",&n);
	rep(i,0,n) {
		scanf("%s%d",op,&x);
		if (op[0]=='|') {///对or操作 0等于没操作 1等于卡死操作 无论前面是什么结果都无关
			rep(i,0,10) if (x&(1<<i)) {
				mask|=(1<<i);///mask表示哪几位改了
				bit|=(1<<i);
			}
		} else if (op[0]=='&') {///对and操作 1等于没操作 0卡死
			rep(i,0,10) if ((x&(1<<i))==0) {
				mask|=(1<<i);
				bit&=(1<<10)-1-(1<<i);///把第i位变为0
			}
		}  else if (op[0]=='^') {///0 xor 0 = 0; 1 xor 0 = 1; 0无影响  0 xor 1 = 1; 1 xor 1 = 0; 1取反 
			rep(i,0,10) if ((x&(1<<i))) {
				if (mask&(1<<i)) bit^=(1<<i);
				bit2^=(1<<i);
			}
		}
	}
	puts("3");
	b1=1023;
	rep(i,0,10) if (mask&(1<<i)) {
		///做出卡死的数
		if (bit&(1<<i)) b2+=(1<<i);
		else b1-=(1<<i);
		///
	} else if (bit2&(1<<i)) b3+=(1<<i);///做出xor
	printf("& %d\n| %d\n^ %d\n",b1,b2,b3);

}
/*
3
| 3
^ 2
| 1
*/