Bob is a sorcerer. He lives in a cuboid room which has a length of AA, a width of BB and a height of CC, so we represent it as AA * BB * CC. One day, he finds that his room is filled with unknown dark energy. Bob wants to neutralize all the dark energy in his room with his light magic. He can summon a 11 * 11 * 22 cuboid at a time to neutralize dark energy. But the cuboid must be totally in dark energy to take effect. Can you foresee whether Bob can save his room or not?

Input

Input has TT test cases. T \le 100T≤100

For each line, there are three integers A, B, CA,B,C.

1 \le A, B, C \le 1001≤A,B,C≤100

Output

For each test case, if Bob can save his room, print"Yes", otherwise print"No".

樣例輸入複製

1 1 2
1 1 4
1 1 1

樣例輸出複製

Yes
Yes
No

題目來源

題目意思是，有一個a*b*c大小的長方體，你用1*1*2大小的長方體來填充，填充過程中，不能超出a*b*c長方體的空間。問是否可以剛好填充。

分析，因為是1*1*2大小，所以以1*1為底面填充一定可以把底面填滿，那麼只需要考慮高就好啦，然後發現，高是二的倍數就可以剛好填充。 

#include<iostream>
#include<cstring>
using namespace std;

int main()
{
	int a,b,c,n,m,j,k,i,T;
	while (cin>>a>>b>>c)
	{
		if(a%2==0 || b%2==0 || c%2==0)
		cout<<"Yes"<<endl;
		else
		cout<<"No"<<endl;
	}
	
	return 0;
}