Apples#11799
Nastia is playing a game. She has red, yellow, and green apples. In one move, she can replace two apples of different colors with one apple of the third color. Nastia wins if, after some number of moves, only one apple of any color remains.
Nastia is so skilled that for any non-negative , , , she can instantly tell whether it is possible to win the game. Can you?
The first line contains a single integer (1 \le t \le 1000) — the number of test cases.
The next lines each contain three integers , , (0 \le a, b, c \le 10^9): the number of red, yellow, and green apples, respectively.
Print digits in a single line, without spaces: if it is possible to win, or if not.
Your answer is considered correct only if you answer all test cases correctly.
Example 1
Let each triplet (a, b, c) denote the number of red, yellow, and green apples, respectively.
For example, in the second test case, the initial triplet is (2, 3, 4). By replacing two apples of different colors with one apple of the third color, the following steps can be performed:
Replace red + yellow: (2, 3, 4) \to (1, 2, 5)
Replace red + yellow: (1, 2, 5) \to (0, 1, 6)
Replace yellow + green: (0, 1, 6) \to (1, 0, 5)
Replace red + green: (1, 0, 5) \to (0, 1, 4)
Replace yellow + green: (0, 1, 4) \to (1, 0, 3)
Replace red + green: (1, 0, 3) \to (0, 1, 2)
Replace yellow + green: (0, 1, 2) \to (1, 0, 1)
Replace red + green: (1, 0, 1) \to (0, 1, 0)
In the end, one yellow apple remains, which means Nastia wins!