#include <bits/stdc++.h>
using namespace std;
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    int ar[n];
    for (int i = 0; i < n; i++) {
      cin >> ar[i];
    }
    sort(ar, ar + n);
    int odd = 0, even = 0, diff = 0;
    for (int i = 0; i < n; i++) {
      if (ar[i] % 2 == 0)
        even++;
      else
        odd++;
    }
    for (int i = 0; i < n - 1; i++) {
      if (ar[i + 1] - ar[i] == 1) diff++;
    }
    if (odd % 2 == 0 && even % 2 == 0) {
      cout << "YES"
           << "\n";
    } else if (diff > 0)
      cout << "YES"
           << "\n";
    else
      cout << "NO"
           << "\n";
  }
  return 0;
}
