#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
constexpr int INF = 1001001001;
constexpr long long INFL = (1LL << 60);
constexpr double eps = (1e-9);
void solve() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < (n); ++i) cin >> a[i];
  sort((a).begin(), (a).end());
  int sa = 0, even = 0, odd = 0;
  for (int i = 0; i < n; i++) {
    if (i > 0 && a[i] - a[i - 1] == 1) sa++;
    if (a[i] % 2 == 0)
      even++;
    else
      odd++;
  }
  if (even % 2 != 0 && sa == 0)
    puts("NO");
  else
    puts("YES");
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int t;
  cin >> t;
  for (int i = 0; i < (t); ++i) solve();
  return 0;
}
