#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    int a[n];
    vector<int> nep, par;
    for (int i = 0; i < n; i++) {
      cin >> a[i];
      if (a[i] % 2) {
        nep.push_back(a[i]);
      } else {
        par.push_back(a[i]);
      }
    }
    sort(nep.begin(), nep.end());
    sort(par.begin(), par.end());
    if (nep.size() % 2 == 0 && par.size() % 2 == 0) {
      cout << "YES" << endl;
    } else if (nep.size() % 2 == 1) {
      int minn = 10000000;
      for (int i = 0; i < nep.size(); i++) {
        for (int j = 0; j < par.size(); j++) {
          minn = min(minn, abs(nep[i] - par[j]));
        }
      }
      if (minn == 1) {
        cout << "YES" << endl;
      } else {
        cout << "NO" << endl;
      }
    } else {
      cout << "NO" << endl;
    }
  }
  return 0;
}
