Divide or take away?#334
There are piles of stones. In each move, you can either take any number of stones from a single pile or split a pile into two smaller piles. The player who takes the last stone wins the game.
Your task is to determine the winner, assuming both players use the optimal strategy: the player who makes the first move or the one who moves second.
The first line contains the number of test cases (1 \leq T \leq 100). Each test case consists of two lines: the first line contains the integer , and the second line contains numbers that specify the number of stones in each pile S_i, separated by spaces.
1 \leq N \leq 10^3
1 \leq S_i \leq 10^6
Output a single line with a sequence of numbers, each being either or , indicating the player who will win for each test case.
Example 1