#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long SIZE = 100000;
const int INF = 0x3f3f3f3f;
const long long ll_INF = 0x3f3f3f3f3f3f3f3f;
const long double PI = acos(-1);
const long long MAXN = numeric_limits<long long>::max();
const long long MAX = 2000000;
void disp(vector<long long> v) {
  for (auto u : v) cout << u << " ";
  cout << '\n';
}
void solve() {
  int n, evn = 0, odd = 0, fg = 0;
  cin >> n;
  vector<int> a(n);
  for (long long i = 0; i < n; i++) cin >> a[i];
  sort((a).begin(), (a).end());
  for (long long i = 0; i < n; i++) {
    if (a[i] + 1 == a[i + 1] && i != n - 1) {
      i++;
      fg = 1;
    } else if (a[i] % 2 == 0)
      evn++;
    else
      odd++;
  }
  if ((evn % 2 == 0 && odd % 2 == 0) ||
      (evn % 2 != 0 && odd % 2 != 0 && fg == 1))
    cout << "YES\n";
  else
    cout << "NO\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t;
  cin >> t;
  while (t--) solve();
  return 0;
}
