Question
Independence Day
On the occasion of Independence Day, Rahul wants to design a new flag for the country of NewtonLand.
He has some equal-sized strips in three different colors and needs to arrange them in a line so that no two adjacent strips share the same color.
Given that Chef has A orange strips, B white strips, and C green strips, determine if it is possible to design such a flag using all the strips.
He has some equal-sized strips in three different colors and needs to arrange them in a line so that no two adjacent strips share the same color.
Given that Chef has A orange strips, B white strips, and C green strips, determine if it is possible to design such a flag using all the strips.
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 A, B, and C - the number of strips of orange, white, and green color respectively.
Constraints
1 ≤ T ≤ 1000
1 ≤ A, B, C ≤ 10
Each test case consists of three space-separated integers A, B, and C - the number of strips of orange, white, and green color respectively.
Constraints
1 ≤ T ≤ 1000
1 ≤ A, B, C ≤ 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 O,W, and G denote one orange, white, and green strip respectively.
Test case 1: Consider the flag OWG where all strips are used and no two adjacent strips have the same color.
Test case 2: It can be shown that Chef 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 O,W, and G denote one orange, white, and green strip respectively.
Test case 1: Consider the flag OWG where all strips are used and no two adjacent strips have the same color.
Test case 2: It can be shown that Chef cannot design a flag with all the strips.