#include <bits/stdc++.h>
using namespace std;
int main() {
  int t, n, c_even, c_odd, c, c1, c2, i, k;
  cin >> t;
  while (t--) {
    cin >> n;
    int a[n];
    c_even = c_odd = c = 0;
    for (i = 0; i < n; i++) {
      cin >> a[i];
    }
    sort(a, a + n);
    for (i = 0, k = 0; i < n; i++) {
      a[i] % 2 ? c_odd++ : c_even++;
      if ((a[k + 1] - a[k]) == 1) {
        c++;
        k = k + 2;
      } else {
        k++;
      }
    }
    c1 = c_even - c;
    c2 = c_odd - c;
    if ((c_even % 2 == 0 && c_odd % 2 == 0) || (c1 % 2 == 0 && c2 % 2 == 0) ||
        (c1 % 2 == 1 && c2 % 2 == 1 && c > 0)) {
      cout << "YES" << endl;
    } else {
      cout << "NO" << endl;
    }
  }
}
