#include <bits/stdc++.h>
using namespace std;
void sieve() {
  bool prime[1000];
  for (long long int i = 0; i < 1000; i++) prime[i] = 1;
  for (long long int i = 2; i <= 1000; i++) {
    if (prime[i])
      for (long long int j = 2 * i; j < 1000; j += i) {
        prime[j] = false;
      }
  }
  for (long long int i = 0; i < 1000; i++)
    if (prime[i]) cout << i << " ";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  while (t--) {
    long long int n;
    cin >> n;
    long long int a[n];
    for (long long int i = 0; i < n; i++) cin >> a[i];
    bool flag = 0;
    sort(a, a + n);
    for (long long int i = 0; i < n - 1; i++)
      if (a[i + 1] - a[i] == 1) flag = 1;
    long long int eve = 0, odd = 0;
    for (long long int i = 0; i < n; i++) {
      if (a[i] % 2 == 0)
        eve++;
      else
        odd++;
    }
    if ((eve % 2 == 0 || odd % 2 == 0) || flag)
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
  return 0;
}
