#include <bits/stdc++.h>
using namespace std;
long long M = 1e9 + 7;
long long mod(long long a, long long m) {
  if (a == 0)
    return 0;
  else
    return (a % m + m) % m;
}
int mod(string num, int a) {
  int res = 0;
  for (int i = 0; i < num.length(); i++)
    res = (res * 10 + (int)num[i] - '0') % a;
  return res;
}
long long d, x, y;
void extendedEuclid(int A, int B) {
  if (B == 0) {
    d = A;
    x = 1;
    y = 0;
  } else {
    extendedEuclid(B, A % B);
    int temp = x;
    x = y;
    y = temp - (A / B) * y;
  }
}
long long modInverse(int A, int M) {
  extendedEuclid(A, M);
  return (x % M + M) % M;
}
long long poow(long long a, long long b, long long m) {
  if (b % 2 == 0)
    return (((long long)pow(a, b / 2) % m) * ((long long)pow(a, b / 2) % m)) %
           m;
  else
    return (((long long)pow(a, (b - 1) / 2) % m) *
            ((long long)pow(a, (b + 1) / 2) % m)) %
           m;
}
bool subsum(long long ar[], long long s, long long n) {
  if (n == 0 && s != 0)
    return false;
  else if (s <= 0)
    return true;
  else if (ar[n - 1] > s)
    return subsum(ar, s, n - 1);
  else
    return (subsum(ar, s - ar[n - 1], n - 1) || subsum(ar, s, n - 1));
}
int binarySearch(int arr[], int l, int r, int x) {
  if (r >= l) {
    int mid = l + (r - l) / 2;
    if (arr[mid] == x) return mid;
    if (arr[mid] > x) return binarySearch(arr, l, mid - 1, x);
    return binarySearch(arr, mid + 1, r, x);
  }
  return -1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long t, n, q, k, i, h, m, c, u, f, j, p, r, s, b, d;
  cin >> t;
  while (t--) {
    cin >> p;
    int o[p], e[p];
    q = r = 0;
    for (i = 0; i < p; i++) {
      cin >> s;
      if (s % 2 == 0)
        e[q++] = s;
      else
        o[r++] = s;
    }
    sort(o, o + r);
    sort(e, e + q);
    if (q % 2 == 0 && r % 2 == 0)
      cout << "YES"
           << "\n";
    else {
      f = 0;
      for (i = 0; i < r; i++)
        if ((binarySearch(e, 0, q - 1, o[i] - 1) != -1) ||
            (binarySearch(e, 0, q - 1, o[i] + 1) != -1)) {
          f = 1;
          break;
        }
      if (f == 1)
        cout << "YES"
             << "\n";
      else
        cout << "NO"
             << "\n";
    }
  }
  return 0;
}
