#include <bits/stdc++.h>
using namespace std;
int main() {
  long long t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    int a[n];
    int even = 0, odd = 0;
    set<int> oddvalue;
    vector<int> evenvalue;
    for (int i = 0; i < n; i++) {
      cin >> a[i];
      if (a[i] % 2 == 0) {
        even++;
        evenvalue.push_back(a[i]);
      } else {
        odd++;
        oddvalue.insert(a[i]);
      }
    }
    if (even % 2 == 0) {
      cout << "YES" << endl;
    } else {
      int found = 0;
      for (int i = 0; i < evenvalue.size(); i++) {
        if (oddvalue.find(evenvalue[i] - 1) != oddvalue.end() ||
            oddvalue.find(evenvalue[i] + 1) != oddvalue.end()) {
          found = 1;
          break;
        }
      }
      if (found == 1)
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
  return 0;
}
