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.
import java.awt.*;
import java.io.*;

import java.math.BigInteger;
import java.util.*;

public class TaskC {


    static class Edge implements Comparable<Edge> {
        int v,cost;


        public Edge( int x, int y) {
            this.v = x;
            this.cost = y;
        }

        public int compareTo(Edge o) {
            if (cost  == o.cost)
                return v - o.v;
            return v - o.v;
        }

        @Override
        public boolean equals(Object o) {
            Edge edge = (Edge) o;
            return v == edge.v &&
                   cost == edge.cost;
        }


        public String toString() {
            return  v+" "+ cost;
        }
    }
    static int n,h;
    static long sum = 0;
    static ArrayList<Edge>[]adjList;
    static int reaches;
    static boolean[]vis;
    static HashSet<Integer> set;


    static void dfs(int u ,int v, int c)
    {
        vis[u] = true;
        if(u == v)
        {
            set.add(c);
            vis[u] = false;
            return;
        }
        for (Edge e : adjList[u])
        {
            if(c == -1)
                dfs(e.v , v , e.cost);
            else if(!vis[e.v] && e.cost == c)
                dfs(e.v , v , c);
        }
        if(c != -1)
            vis[u] = false;
    }



    public static void main(String[] args) throws Exception {

        Scanner sc = new Scanner(System.in);
        PrintWriter pw = new PrintWriter(System.out);

        int t = sc.nextInt();
        while (t-->0) {

            int[] arr = new int[]{sc.nextInt(), sc.nextInt(), sc.nextInt(), sc.nextInt()};

            int e = 0;
            int o = 0;
            for (int i = 0; i < 4; i++) {
                if (arr[i] % 2 == 0)
                    e++;
                else
                    o++;
            }
            if (e == 4 || e == 3) {
                pw.println("Yes");
                continue;
            }
            int neg = 0;
            e = 0;
            o = 0;
            for (int i = 0 ; i < 3 ; i++)
            {
                arr[i]--;
                if(arr[i] < 0)
                    neg++;
                if(arr[i]%2==0)e++;
                else o++;
            }
            arr[3]+=3;
            e+=(arr[3]%2 == 0)?1:0;
            if(neg > 0)
                pw.println("No");
            else
            {
                if(e == 3 || e == 4)
                    pw.println("Yes");
                else
                    pw.println("No");
            }
        }
        pw.close();
    }
    static class Point implements Comparable<Point>
    {
        int x ,y , idx;

        public Point(int x, int y,int idx) {
            this.x = x;
            this.y = y;
            this.idx = idx;
        }

        @Override
        public int compareTo(Point o) {
            if (x == o.x) {
                if (y == o.y)
                    return idx - o.idx;
                return y - o.y;
            }
            return x - o.x;
        }

        @Override
        public String toString() {
            return "Point{" +
                    "x=" + x +
                    ", y=" + y +
                    ", idx=" + idx +
                    '}';
        }
    }

    static class Circle implements Comparable<Circle>
    {
        int x , radius;
        public Circle(int x , int r)
        {
            this.x = x;
            this.radius = r;
        }

        public boolean isInside(Point p)
        {
            return Math.sqrt((p.x - x)*(p.x - x) + (p.y)*(p.y)) <= radius;
        }

        @Override
        public String toString() {
            return "Circle{" +
                    "x=" + x +
                    ", radius=" + radius +
                    '}';
        }

        @Override
        public int compareTo(Circle o) {
            return x - o.x;
        }
    }

    private static long gcd(long a, long b) {
        if( b == 0)
            return a;
        return gcd(b  , a%b);
    }

    static long lcm(int a, int b)
    {
        return (a*b)/gcd(a, b);
    }


    private  static int dis(int xa , int ya , int xb , int yb)
    {
        return (xa-xb)*(xa - xb) + (ya- yb)*(ya-yb);
    }


    static class Pair implements Comparable<Pair> {
        int x,y;


        public Pair(int x, int y) {
            this.x = x;
            this.y = y;
        }

        public int compareTo(Pair o) {
            if (y  == o.y)
                return x - o.x;
            return y - o.y;

        }

        public double dis(Pair a){

            return (a.x - x)*(a.x - x) + (a.y-y)*(a.y-y);
        }

        public String toString() {
            return  x+" "+ y;
        }
        public boolean overlap(Pair a)
        {
            if((this.x >= a.x && this.x <= a.y) || (a.x >= this.x && a.x <= this.y)) return true;
            return false;

        }
    }

    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(FileReader r) {
            br = new BufferedReader(r);
        }

        public Scanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        public String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return st.nextToken();
        }

        public boolean check() {
            if (!st.hasMoreTokens())
                return false;
            return true;
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public String nextLine() {
            try {
                return br.readLine();
            } catch (Exception e) {
                throw new RuntimeException(e);
            }
        }

        public double nextDouble() {
            String x = next();
            StringBuilder sb = new StringBuilder("0");
            double res = 0, f = 1;
            boolean dec = false, neg = false;
            int start = 0;
            if (x.charAt(0) == '-') {
                neg = true;
                start++;
            }
            for (int i = start; i < x.length(); i++)
                if (x.charAt(i) == '.') {
                    res = Long.parseLong(sb.toString());
                    sb = new StringBuilder("0");
                    dec = true;
                } else {
                    sb.append(x.charAt(i));
                    if (dec)
                        f *= 10;
                }
            res += Long.parseLong(sb.toString()) / f;
            return res * (neg ? -1 : 1);
        }

        public boolean ready() {
            try {
                return br.ready();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
    }
}