Read problems statements in [Hindi], [Mandarin Chinese], [Russian], [Vietnamese], and [Bengali] as well.

This problem has no story, so we at least wish you good luck solving it.

Consider a multiset $S$ which contains $A$ copies of the integer $1$, $B$ copies of $2$ and $C$ copies of $3$. For example, if $A = 3$, $B = 3$ and $C = 3$, then $S = \{1, 1, 1, 2, 2, 2, 3, 3, 3\}$.

Your goal is to divide the elements of $S$ into two groups (multisets); each element of $S$ must be in exactly one of these groups and the sum of elements of one group must be equal to the sum of elements of the other group. In our example, it is possible to make the groups $\{1, 1, 2, 2, 3\}$ and $\{1, 2, 3, 3\}$; the sum of elements of each group is $9$.

Determine if it is possible to make such groups.

------ Input ------
The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows.
The first and only line of each test case contains three space-separated integers $A$, $B$ and $C$.

------ Output ------
For each test case, print a single line containing the string "YES" if it is possible to create two groups with equal sums or "NO" if it is impossible.

------ Constraints ------
$1 ≤ T ≤ 1,000$
$0 ≤ A, B, C ≤ 1,000,000$
$A + B + C ≥ 1$

----- Sample Input 1 ------
5

3 3 3

3 2 3

1 1 2

1 0 1

1 1 1
----- Sample Output 1 ------
YES

YES

NO

NO

YES

见题面

见题面