#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    vector<int> v, ve, vo;
    for (int i = 0; i < n; i++) {
      int x;
      cin >> x;
      v.push_back(x);
      if (x % 2) {
        vo.push_back(x);
      } else {
        ve.push_back(x);
      }
    }
    sort(v.begin(), v.end());
    sort(vo.begin(), vo.end());
    sort(ve.begin(), ve.end());
    int n1 = vo.size();
    int n2 = ve.size();
    int f = 0;
    if (n1 % 2 == 0 && n2 % 2 == 0) {
      cout << "YES" << endl;
    } else {
      for (int i = 0; i < n1; i++) {
        for (int j = 0; j < n2; j++) {
          if ((vo[i] + 1 == ve[j]) || (vo[i] - 1 == ve[j])) {
            f = 1;
            break;
          }
        }
        if (f) {
          break;
        }
      }
      if (f) {
        cout << "YES" << endl;
      } else {
        cout << "NO" << endl;
      }
    }
  }
}
