#include <bits/stdc++.h>
using namespace std;
long long modularExponentiation(long long x, long long n, long long M) {
  if (n == 0)
    return 1;
  else if (n % 2 == 0)
    return modularExponentiation((x * x) % M, n / 2, M);
  else
    return (x * modularExponentiation((x * x) % M, (n - 1) / 2, M)) % M;
}
int main() {
  int t = 1;
  cin >> t;
  while (t--) {
    long long r, b, g, w, cnt0 = 0, cnte = 0;
    cin >> r >> g >> b >> w;
    if (r % 2 != 0) cnt0++;
    if (g % 2 != 0) cnt0++;
    if (b % 2 != 0) cnt0++;
    if (w % 2 != 0) cnt0++;
    if (cnt0 <= 1)
      cout << "YES" << endl;
    else if (r == 0 || g == 0 || b == 0)
      cout << "NO" << endl;
    else {
      if (cnt0 == 2)
        cout << "NO" << endl;
      else
        cout << "YES" << endl;
    }
  }
  return 0;
}
