#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, 1, -1, -1, -1, 1, 1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
template <class T>
inline T biton(T n, T pos) {
  return n | ((T)1 << pos);
}
template <class T>
inline T bitoff(T n, T pos) {
  return n & ~((T)1 << pos);
}
template <class T>
inline T ison(T n, T pos) {
  return (bool)(n & ((T)1 << pos));
}
template <class T>
inline T gcd(T a, T b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
inline int nxt() {
  int aaa;
  scanf("%d", &aaa);
  return aaa;
}
inline long long lxt() {
  long long aaa;
  scanf("%lld", &aaa);
  return aaa;
}
inline double dxt() {
  double aaa;
  scanf("%lf", &aaa);
  return aaa;
}
template <class T>
inline T bigmod(T p, T e, T m) {
  T ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % m;
    p = (p * p) % m;
  }
  return (T)ret;
}
template <class T>
istream& operator>>(istream& is, vector<T>& input) {
  for (T& in : input) is >> in;
  return is;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& input) {
  bool isFirst = true;
  for (T out : input) {
    if (isFirst) {
      os << out;
      isFirst = false;
    } else
      os << " " << out;
  }
  return os;
}
void solve() {
  int r = nxt(), g = nxt(), b = nxt(), w = nxt();
  if (r == 0 || g == 0 || b == 0) {
    int cnt = 0;
    if (r & 1) cnt++;
    if (g & 1) cnt++;
    if (b & 1) cnt++;
    if (w & 1) cnt++;
    if (cnt > 1) {
      cout << "No\n";
      return;
    }
    cout << "Yes\n";
    return;
  }
  int mn = min({r, g, b});
  r -= mn, g -= mn, b -= mn;
  w += (mn * 3);
  for (int i = 0; i < min(mn, 5); i++) {
    r += i;
    g += i;
    b += i;
    w -= (i * 3);
    int cnt = 0;
    if (r & 1) cnt++;
    if (g & 1) cnt++;
    if (b & 1) cnt++;
    if (w & 1) cnt++;
    if (cnt <= 1) {
      cout << "Yes\n";
      return;
    }
  }
  cout << "No\n";
}
int main() {
  cout.setf(ios::fixed);
  cout.precision(10);
  int tc = nxt();
  while (tc--) {
    solve();
  }
  return 0;
}
