B'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. The first line contains an integer n (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x895 xc2 xb7105) -- 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 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89xi xe2 x80 x89 xe2 x89 xa4 xe2 x80 x891023. Output an integer k (0 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89k xe2 x80 x89 xe2 x89 xa4 xe2 x80 x895) -- the length of your program. Next k lines must contain commands in the same format as in the input. 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 xe2 x80 x89= xe2 x80 x89x&(1&3&5) xe2 x80 x89= xe2 x80 x89x&1. So these two programs always give the same outputs. '...