Question
Flag Craft
Rahul, celebrating Freedom Fest, plans a unique flag for StarLand. He has equal-sized strips in three colors and must arrange them in a row with no two adjacent strips of the same color. With X white, Y yellow, and Z red strips, check if he can use all strips to create such a flag.
Input
The first line of input will contain a single integer T, denoting the number of test cases.
Each test case consists of three space-separated integers X, Y, and Z - the number of strips of white, yellow, and red color respectively.
Constraints
1 ≤ T ≤ 1000
1 ≤ X, Y, Z ≤ 10
Each test case consists of three space-separated integers X, Y, and Z - the number of strips of white, yellow, and red color respectively.
Constraints
1 ≤ T ≤ 1000
1 ≤ X, Y, Z ≤ 10
Output
For each test case, output on a new line, Yes, if it is possible to design a flag using all the strips such that no two adjacent strips share the same colour. Otherwise, print No.
Example
Sample Input
3
1 1 1
2 3 10
2 3 4
Sample Output
Yes
No
Yes
Explanation
Let W, Y, and R denote one White, Yellow, and Red strip respectively.
Test case 1: Consider the flag WYR where all strips are used and no two adjacent strips have the same color.
Test case 2: It can be shown that Rahul cannot design a flag with all the strips.
3
1 1 1
2 3 10
2 3 4
Sample Output
Yes
No
Yes
Explanation
Let W, Y, and R denote one White, Yellow, and Red strip respectively.
Test case 1: Consider the flag WYR where all strips are used and no two adjacent strips have the same color.
Test case 2: It can be shown that Rahul cannot design a flag with all the strips.