#include <bits/stdc++.h>
using namespace std;
int main() {
  int tc, cs = 1;
  scanf("%lld", &tc);
  while (tc--) {
    long long n;
    scanf("%lld", &n);
    long long a[n + 5];
    vector<long long> v1, v2;
    for (int i = 0; i < n; i++) {
      scanf("%lld", &a[i]);
      if (a[i] % 2 == 0)
        v1.push_back(a[i]);
      else
        v2.push_back(a[i]);
    }
    sort(a, a + n);
    int c = 0;
    for (int i = 0; i < n - 1; i++) {
      if (a[i + 1] - a[i] == 1) c++;
    }
    if (v1.size() % 2 == 0 || c > 0)
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
  return 0;
}
