Problem: 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. 

Input

The first line contains one integer T (1≤ T≤ 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≤ r,g,b,w≤ 10^9).

Output

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".

Example

Input


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


Output


No
Yes
Yes
Yes

Note

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.

Solution (in JAVA):

Solution:

import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;

import javax.swing.plaf.synth.SynthSeparatorUI;
import javax.xml.crypto.dsig.spec.C14NMethodParameterSpec;

public class Round659 {

	static int ans=0;
	static int rec=0;
	static int X[] = { -1, 0, 0, 1 };
	static int Y[] = { 0, -1, 1, 0 };

	static class Reader {
		final private int BUFFER_SIZE = 1 << 16;
		private DataInputStream din;
		private byte[] buffer;
		private int bufferPointer, bytesRead;

		public Reader() {
			din = new DataInputStream(System.in);
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public Reader(String file_name) throws IOException {
			din = new DataInputStream(new FileInputStream(file_name));
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public String readLine() throws IOException {
			byte[] buf = new byte[64]; // line length
			int cnt = 0, c;
			while ((c = read()) != -1) {
				if (c == '\n')
					break;
				buf[cnt++] = (byte) c;
			}
			return new String(buf, 0, cnt);
		}

		public int nextInt() throws IOException {
			int ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');

			if (neg)
				return -ret;
			return ret;
		}

		public long nextLong() throws IOException {
			long ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');
			if (neg)
				return -ret;
			return ret;
		}

		public double nextDouble() throws IOException {
			double ret = 0, div = 1;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();

			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');

			if (c == '.') {
				while ((c = read()) >= '0' && c <= '9') {
					ret += (c - '0') / (div *= 10);
				}
			}

			if (neg)
				return -ret;
			return ret;
		}

		private void fillBuffer() throws IOException {
			bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
			if (bytesRead == -1)
				buffer[0] = -1;
		}

		private byte read() throws IOException {
			if (bufferPointer == bytesRead)
				fillBuffer();
			return buffer[bufferPointer++];
		}

		public void close() throws IOException {
			if (din == null)
				return;
			din.close();
		}
	}

	public static long[] initArray(int n, Reader scan) throws IOException {

		long arr[] = new long[n];
		for (int i = 0; i < n; i++) {
			arr[i] = scan.nextLong();
		}

		return arr;
	}

	public static long sum(long arr[]) {

		long sum = 0;
		for (long i : arr) {
			sum += (long) i;
		}

		return sum;
	}

	public static long max(long arr[]) {

		long max = Long.MIN_VALUE;

		for (long i : arr) {
			max = Math.max(i, max);
		}

		return max;
	}

	public static long min(long arr[]) {
		long min = Long.MAX_VALUE;

		for (long i : arr) {
			min = Math.min(i, min);
		}

		return min;
	}

	public static List<Integer>[] initAdjacency(int n, int e, Reader scan, boolean type) throws IOException {

		List<Integer> adj[] = new ArrayList[n + 1];

		for (int i = 0; i < e; i++) {
			int u = scan.nextInt();
			int v = scan.nextInt();

			if (adj[u] == null)
				adj[u] = new ArrayList<>();
			if (type && adj[v] == null)
				adj[v] = new ArrayList<>();

			adj[u].add(v);

			if (type)
				adj[v].add(u);

		}

		return adj;
	}
	public static void main(String[] args) throws IOException {
		
		Reader scan=new Reader();
//		Scanner scan=new Scanner(System.in);
		
		
		int t=scan.nextInt();
		while(t-->0) {
//			int n=scan.nextInt();
//			int m=scan.nextInt();
//			int m=scan.nextInt();
//			int k=scan.nextInt();
//			int l=scan.nextInt();
//			int arr[]=new int[n];
//			
//			for(int i=0;i<n;i++) {
//				arr[i]=scan.nextInt();
//			}
//			
			long a=scan.nextLong();
			long b=scan.nextLong();
			long c=scan.nextLong();
			long d=scan.nextLong();
			A(a, b, c, d);
		}

	
	}
	
	public static void A(long a, long b, long c, long d) {
		
		
		if(a%2==0&&b%2==0&&c%2==0) {
			System.out.println("Yes");
			return;
		}
		
		if(a%2!=0&&b%2!=0&&c%2!=0) {
			System.out.println("Yes");
			return;
		}
		
		int eC=0;
		
		if(a%2==0) {
			eC++;
		}
		
		if(b%2==0) {
			eC++;
		}
		
		if(c%2==0) {
			eC++;
		}
		
		
		if(eC==1) {
			boolean can= canTransform(a, b, c);
			
			if(can) {
				a--;
				b--;
				c--;
				d++;
			}
			
			int newEc=0;
			
			if(a%2==0) {
				newEc++;
			}
			
			if(b%2==0) {
				newEc++;
			}
			
			if(c%2==0) {
				newEc++;
			}
			
			if(d%2==0) {
				newEc++;
			}
			
			if(newEc==3) {
				System.out.println("Yes");
			}else {
				System.out.println("No");
			}
			return;
		}
		
		if(d%2==0) {
			System.out.println("Yes");
		}else {
			System.out.println("No");
		}
		
		
		
		
	}
	
	public static boolean canTransform(long a, long b, long c) {
		
		if(a<=0||b<=0||c<=0) return false;
		
		return true;
		
	}
	
	public static void helper(long dp[]) {
		
		
		long mod=1000000007;
		dp[3]=2;
		
		for(int i=4;i<=1000000;i++) {
			
			dp[i]= (((long)i*2)*dp[i-1])%mod;
			
			dp[i]*= BigInteger.valueOf(i-3).modInverse(BigInteger.valueOf(mod)).longValue();
			
			dp[i]%=mod;
		}
	}
	
	
	public static void C(int n, long dp[]) {
		
		System.out.println(dp[n]);
	}
	
	public static void B(int n, int m, char arr[][]) {
		
		
		int ans=0;
		
		for(int j=0;j<m-1;j++) {
			if(arr[n-1][j]=='D') {
				ans++;
			}
		}
		
		for(int i=0;i<n-1;i++) {
			if(arr[i][m-1]=='R') {
				ans++;
			}
		}
		
		System.out.println(ans);
		
		
	}
	
	
	
	
	
	
	public static void D(int n,int m, String arr[]) {
		
		
		if(n>=4&&m>=4) {
			System.out.println(-1);
			return;
		}
		
		if(n==1||m==1) {
			System.out.println(0);
			return;
		}
		
		
		if(n==2) {
			
		}
		
	}
	
	
}