#include <bits/stdc++.h>
using namespace std;
long long t, n, m, r, l, h, i, ii, j, x[1000001], y[1000001], z, g, a, b, c, d,
    k, mod = 1e9 + 7, q;
vector<long long> v;
vector<pair<long long, long long> > vv;
queue<pair<long long, long long> > qq;
pair<long long, long long> p[1000001];
map<long long, long long> mp, mpp, mppp;
set<pair<long long, long long> > se[1000001];
multiset<long long> sw;
multiset<long long>::iterator it;
string s;
char cc;
int main() {
  ios::sync_with_stdio(0);
  cin >> t;
  while (t--) {
    mp.clear();
    cin >> n;
    b = 0;
    for (i = 0; i < n; i++) cin >> x[i];
    sort(x, x + n);
    for (i = 0; i < n; i++) {
      mp[x[i] % 2]++;
      if (x[i] == x[i - 1] + 1 && i > 0) b = 1;
    }
    a = mp[0] % 2;
    c = mp[1] % 2;
    if ((a == c && a == 0) || (a == c && a == 1 && b == 1))
      cout << "YES";
    else
      cout << "NO";
    cout << endl;
  }
  return 0;
}
