#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long extended_gcd(long long a, long long b, long long& x, long long& y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long x1, y1;
  long long d = extended_gcd(b, a % b, x1, y1);
  x = y1;
  y = x1 - y1 * (a / b);
  return d;
}
vector<int> sieveoferatosthenes(int n) {
  vector<bool> prime(n + 1, true);
  for (int i = 2; i <= sqrt(n); i++) {
    if (prime[i]) {
      for (int j = i * i; j <= n; j += i) {
        prime[j] = false;
      }
    }
  }
  vector<int> all_primes;
  for (int i = 2; i <= n; i++) {
    if (prime[i]) all_primes.push_back(i);
  }
  return all_primes;
}
long long bin_exp(long long a, long long b, long long mod) {
  long long ans = 1;
  while (b) {
    if (b % 2) {
      b--;
      ans = (ans % mod * a % mod) % mod;
    }
    b /= 2;
    a = (a % mod * a % mod) % mod;
  }
  return ans;
}
void bfs(vector<int>& distance, vector<int> a[], vector<bool>& visited, int u,
         vector<int>& parent) {
  visited[u] = true;
  parent[u] = -1;
  distance[u] = 0;
  queue<int> q;
  q.push(u);
  while (!q.empty()) {
    int f = q.front();
    q.pop();
    for (int i = 0; i < a[f].size(); i++) {
      if (visited[a[f][i]] == false) {
        distance[a[f][i]] = distance[f] + 1;
        parent[a[f][i]] = f;
        visited[a[f][i]] = true;
        q.push(a[f][i]);
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    vector<int> a(n), o, e;
    for (int i = 0; i < n; i++) {
      cin >> a[i];
      if (a[i] % 2 == 0)
        e.push_back(a[i]);
      else
        o.push_back(a[i]);
    }
    if (o.size() % 2 == 0 and e.size() % 2 == 0) {
      cout << "YES"
           << "\n";
    } else {
      int f = 0;
      sort(e.begin(), e.end());
      sort(o.begin(), o.end());
      for (int i = 0; i < e.size(); i++) {
        for (int j = 0; j < o.size(); j++) {
          if (abs(e[i] - o[j]) == 1) {
            f = 1;
            break;
          }
        }
      }
      if (f)
        cout << "YES"
             << "\n";
      else
        cout << "NO"
             << "\n";
    }
  }
  return 0;
}
