Block

Time limit1sMemory limit1024 MB

Summary

Given A unit squares, B dominoes, and C L-shaped trominoes, decide whether they tile a height-2 rectangle with no gaps and all tiles used.

Level: Medium4 of 10
Topics: Math, Greedy, Implementation, Brute force
Solved: No attempts yet

Problem

You are given $A$ tiles of the first kind, $B$ tiles of the second kind, and $C$ tiles of the third kind, as shown in the figure below. Write a program that prints Yes if you can build a rectangle of height 2, and No otherwise.

The finished rectangle must have no empty space, and you must use every tile you are given. Tiles cannot be rotated.

For example, with one $1\times 1$ tile, three $2\times 1$ tiles, and one L-shaped tile, you can build a rectangle of height 2 as in the figure below.

But with one $1\times 1$ tile, two $2\times 1$ tiles, and no L-shaped tile, you can never build a rectangle of height 2, as in the figure below.

Input

The first line contains an integer $T$ , the number of test cases.

Each of the next $T$ lines contains three integers $A$ , $B$ , $C$ . $A$ , $B$ , and $C$ are the numbers of $1\times 1$ tiles, $2\times 1$ tiles, and L-shaped tiles, respectively.

Output

For each test case, print the answer on its own line, for $T$ lines in total.

Constraints

$1 \leq T \leq 1000$
$0 \leq A, B, C \leq 1\,000\,000\,000$
$0 < A + B + C$

Examples1

Example 1
Input
```
3
1 3 1
1 2 0
4 4 0
```
Expected output
```
Yes
No
Yes
```