#include <bits/stdc++.h>
using namespace std;
int main() {
  long long t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long a[n];
    unordered_set<long long> s;
    for (long long i = 0; i < n; i++) {
      cin >> a[i];
      s.insert(a[i]);
    }
    long long e = 0, o = 0;
    for (long long i = 0; i < n; i++) {
      if (a[i] % 2 == 0)
        e++;
      else
        o++;
    }
    if (e % 2 == 0)
      cout << "YES"
           << "\n";
    else {
      long long f = 0;
      for (long long i = 0; i < n; i++) {
        if ((s.find(a[i] - 1) != s.end()) || (s.find(a[i] + 1) != s.end())) {
          f = 1;
          break;
        }
      }
      if (f == 1)
        cout << "YES\n";
      else
        cout << "NO"
             << "\n";
    }
  }
  return 0;
}
