Only three handfuls!#567
There are three heaps of stones. Vasya and Petya play a game, taking turns, with Petya always going first. On a move, a player may take any number of stones from one heap, or the same number of stones from two heaps. The player who takes the last stone wins. Determine which player will win if both play optimally.
The first line contains the number of test cases (1 \leq T \leq 20). Each of the following lines contains three integers , , separated by spaces — the number of stones in each heap.
(0 \leq A, B, C \leq 301 and A+B+C > 0).
For each test case, output a single line: if Petya wins, or if Vasya wins.
Example 1