A13756 | $Boboniu Likes to Color Balls$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

Boboniu gives you - $r$ red balls, - $g$ green balls, - $b$ blue balls, - $w$ white balls. He allows you to do the following operation as many times as you want: - Pick a red ball, a green ball, and a blue ball and then change their color to white. You should answer if it's possible to arrange all the balls into a palindrome after several (possibly zero) number of described operations.

The first line contains one integer $T$ ( $1\le T\le 100$ ) denoting the number of test cases. For each of the next $T$ cases, the first line contains four integers $r$ , $g$ , $b$ and $w$ ( $0\le r,g,b,w\le 10^9$ ).

For each test case, print "Yes" if it's possible to arrange all the balls into a palindrome after doing several (possibly zero) number of described operations. Otherwise, print "No".

输入 #1

4
0 1 1 1
8 1 9 3
0 0 0 0
1000000000 1000000000 1000000000 1000000000

输出 #1

No
Yes
Yes
Yes

C++ 编辑器

输入

输出