#include <bits/stdc++.h>
using namespace std;
bool pr[10000005] = {false};
vector<long long> prime;
long long max1(long long a, long long b) {
  if (a > b)
    return a;
  else
    return b;
}
long long min1(long long a, long long b) {
  if (a < b)
    return a;
  else
    return b;
}
long long mul(long long a, long long b) {
  return ((a % 1000000007) * (b % 1000000007)) % 1000000007;
}
void prim() {
  pr[0] = true;
  pr[1] = true;
  for (long long i = 2; i <= sqrt(100005); i++) {
    for (long long j = i * 2; j <= sqrt(100005); j += i) {
      pr[j] = true;
    }
  }
}
vector<long long> divisor(long long n) {
  vector<long long> div;
  div.push_back(n);
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      div.push_back(i);
      if (n / i != i) div.push_back(n / i);
    }
  }
  sort(div.begin(), div.end());
  return div;
}
long long modInverse(long long a, long long m) {
  long long m0 = m;
  long long y = 0, x = 1;
  if (m == 1) return 0;
  while (a > 1) {
    long long q = a / m;
    long long t = m;
    m = a % m, a = t;
    t = y;
    y = x - q * y;
    x = t;
  }
  if (x < 0) x += m0;
  return x;
}
long long find(long long n) {
  long long count = 0;
  while (n) {
    count++;
    n = n / 2;
  }
  return count;
}
void solve() {
  long long r, g, b, w;
  cin >> r >> g >> b >> w;
  long long odd = r % 2 + g % 2 + b % 2 + w % 2;
  bool flag = false;
  if (r == 0 || g == 0 || b == 0) flag = true;
  if (odd == 0) {
    cout << "Yes\n";
  } else if (odd >= 3) {
    if (flag)
      cout << "No\n";
    else
      cout << "Yes\n";
  } else if (odd <= 1) {
    cout << "Yes\n";
  } else
    cout << "No\n";
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
