#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  scanf("%d", &n);
  vector<int> v(n);
  int par = 0, impar = 0;
  for (int i = 0; i < n; ++i) {
    scanf("%d", &v[i]);
    if (v[i] % 2 == 0)
      impar++;
    else
      par++;
  }
  sort((v).begin(), (v).end());
  if (n == 2) {
    if (v[1] - v[0] == 1 || v[0] % 2 == v[1] % 2)
      puts("YES");
    else
      puts("NO");
  } else {
    if (impar % 2 == 0 && par % 2 == 0)
      puts("YES");
    else {
      int dist = 0;
      for (int i = 1; i < n; i++)
        if (v[i] - v[i - 1] == 1) dist++;
      if (dist > 0)
        puts("YES");
      else
        puts("NO");
    }
  }
}
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    solve();
  }
  return 0;
}
