#include <bits/stdc++.h>
int n, k;
using namespace std;
int dp[10][10][10];
int lcs(int dp[10][10][10], int arr1[], int n, int arr2[], int m, int k) {
  if (k < 0) return -1e7;
  if (n < 0 || m < 0) return 0;
  int& ans = dp[n][m][k];
  if (ans != -1) return ans;
  ans = max(lcs(dp, arr1, n - 1, arr2, m, k), lcs(dp, arr1, n, arr2, m - 1, k));
  if (arr1[n - 1] == arr2[m - 1])
    ans = max(ans, 1 + lcs(dp, arr1, n - 1, arr2, m - 1, k));
  ans = max(ans, 1 + lcs(dp, arr1, n - 1, arr2, m - 1, k - 1));
  return ans;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) {
    int a, b, c, d;
    cin >> a >> b >> c >> d;
    int scr = 0, fll = 0;
    if (a % 2 == 0) {
      scr++;
    }
    if (b % 2 == 0) {
      scr++;
    }
    if (c % 2 == 0) {
      scr++;
    }
    if (d % 2 == 0) {
      scr++;
    }
    if (a == 0 || b == 0 || c == 0) {
      fll = 1;
    }
    if (fll == 1) {
      if (scr >= 3) {
        cout << "Yes" << endl;
      } else {
        cout << "No" << endl;
      }
    } else {
      if (scr == 4 || scr == 3 || scr == 1 || scr == 0) {
        cout << "Yes" << endl;
      } else {
        cout << "No" << endl;
      }
    }
  }
}
