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

#include <iostream>
#include<stdio.h>
#include<string.h>
using namespace std;

int main()
{
   int x,y,z;
   while(scanf("%d%d%d",&x,&y,&z)!=EOF)
   {
       int sum=x*y*z;
       if(sum%2==0)printf("Yes\n");
       else printf("No\n");
   }
    return 0;
}
 

題目來源