Game of Chips#2444
For years, Uncle Semen has worked as a guard at a warehouse where old processors are stored. His job is extremely monotonous, so he spends his working hours playing an intriguing game.
Semen takes red chips, blue chips, and green chips. In a single move, he can replace two chips of different colors with one chip of the third color. The game is considered "played" if, after a sequence of moves, only one chip remains.
Over the years, Semen has mastered this game so thoroughly that for any non-negative values of , , and , he can instantly determine whether it is possible to "play" the game. You need to learn to do this as well.
The first line contains a positive integer — the number of test cases (1 \leq N \leq 1000).
Each of the following lines contains a test case: three integers , , and (0 \leq A, B, C \leq 2^{63} - 1).
For each test case, output "Yes" if it is possible to "play" the game, otherwise output "No". Output each answer on a separate line.
Example 1