CF1395A.Boboniu Likes to Color Balls

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.

Boboniu 给你：

• $r$ 个红球，
• $g$ 个绿球，
• $b$ 个蓝球，
• $w$ 个白球。

他允许你执行以下操作任意多次（包括零次）：

• 任选一个红球、一个绿球和一个蓝球，并将它们全部变为白色。

你需要判断：经过若干次（可能为零次）上述操作后，是否能将所有球排成一个回文序列。

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$).

第一行包含一个整数 $T$（$1\le T\le 100$），表示测试用例的数量。

接下来的 $T$ 个测试用例中，每个用例的第一行包含四个整数 $r$、$g$、$b$ 和 $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".

对于每个测试用例，如果可以通过执行若干次（可能为零次）所述操作，将所有球排列成一个回文序列，则输出“Yes”；否则输出“No”。

In the first test case, you're not able to do any operation and you can never arrange three balls of distinct colors into a palindrome.

In the second test case, after doing one operation, changing $(8,1,9,3)$ to $(7,0,8,6)$, one of those possible palindromes may be "rrrwwwbbbbrbbbbwwwrrr".

A palindrome is a word, phrase, or sequence that reads the same backwards as forwards. For example, "rggbwbggr", "b", "gg" are palindromes while "rgbb", "gbbgr" are not. Notice that an empty word, phrase, or sequence is palindrome.

在第一个测试用例中，你无法执行任何操作，因此永远无法将三个不同颜色的球排列成回文。

在第二个测试用例中，执行一次操作，将 $(8,1,9,3)$ 变为 $(7,0,8,6)$ 后，一种可能的回文串为 "rrrwwwbbbbrbbbbwwwrrr"。

回文是指正读与反读都相同的单词、短语或序列。例如，"rggbwbggr"、"b"、"gg" 是回文，而 "rgbb"、"gbbgr" 不是。注意：空单词、空短语或空序列也被视为回文。