Game of Chips
For 10 years, Uncle Semen has been working 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 uses A red chips, B blue chips, and C 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 series of moves, only one chip remains.
Over the years, Semen has mastered this game to the extent that for any non-negative values of A, B, and C, he can instantly determine whether it is possible to "play" the game. Your task is to learn how to do this as well.
Input
The first line of the input file contains a natural number N - the number of tests (1 ≤ N ≤ 1000).
Each of the following N lines contains a test case with three integers: A, B, and C (0 ≤ A, B, C ≤ 2^63-1).
Output
For each test case, output "Yes" if it is possible to "play" the game, otherwise output "No". Provide the answer for each test case on a separate line.