#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
double pi = 2 * acos(0.0);
long long max(long long a, long long b) { return (a > b) ? a : b; }
long long min(long long a, long long b) { return (a < b) ? a : b; }
bool cmp(pair<long long, long long> a, pair<long long, long long> b) {
  return (a.first) < (b.first);
}
long long power(long long a, long long b) {
  long long p = 1;
  for (long long i = 1; i <= b; i++) p *= a;
  return p;
}
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
void bfs(map<long long, vector<long long> > &g, long long src,
         vector<long long> &c) {
  queue<long long> q;
  map<long long, long long> p;
  q.push(src);
  p[src] = src;
  c[src] = 1;
  while (!q.empty()) {
    long long u = q.front();
    q.pop();
    long long i = 1;
    for (auto v : g[u]) {
      if (c[v] == -1) {
        q.push(v);
        p[v] = u;
        if (i == c[u] || i == c[p[u]]) i++;
        if (i == c[u] || i == c[p[u]]) i++;
        c[v] = i;
        i++;
      }
    }
  }
}
long long dp[100005];
long long fun(vector<long long> &h, long long n) {
  if (n == 0) return 0;
  if (dp[n] != -1) return dp[n];
  if (n == 1)
    dp[n] = abs(h[n] - h[n - 1]);
  else
    dp[n] = min(abs(h[n] - h[n - 1]) + fun(h, n - 1),
                abs(h[n] - h[n - 2]) + fun(h, n - 2));
  return dp[n];
}
int main() {
  ios_base::sync_with_stdio(false);
  cout.tie(NULL);
  cout.tie(NULL);
  ;
  long long t;
  cin >> t;
  while (t--) {
    long long n, i, o = 0, e = 0;
    cin >> n;
    long long a[n];
    for (i = 0; i < n; i++) {
      cin >> a[i];
      if (a[i] % 2 == 0)
        e++;
      else
        o++;
    }
    sort(a, a + n);
    if (o % 2 == 0 && e % 2 == 0) {
      cout << "YES" << endl;
      continue;
    }
    bool flag = false;
    for (i = 1; i < n; i++) {
      if (a[i] - a[i - 1] == 1) {
        flag = true;
        break;
      }
    }
    if (flag)
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
  return 0;
}
