#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
int qpow(int x, int y, int mod) {
  if (y == 1) return x;
  int z = qpow(x, y / 2, mod);
  if (y & 1)
    return ((1ll * z * z) % mod * x) % mod;
  else
    return (1ll * z * z) % mod;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
void solve() {
  int r, b, g, w;
  cin >> r >> g >> b >> w;
  int odd = 0;
  if (r & 1) odd++;
  if (g & 1) odd++;
  if (b & 1) odd++;
  if (w & 1) odd++;
  bool zero = 0;
  if (r == 0 || g == 0 || b == 0) {
    zero = 1;
  }
  if (odd == 0 || odd == 4 || odd == 1) {
    cout << "Yes" << endl;
    return;
  }
  if (odd == 3) {
    if (!zero) {
      cout << "Yes" << endl;
      return;
    }
  }
  cout << "No" << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int tst = 1;
  cin >> tst;
  while (tst--) solve();
  return 0;
}
