#include <bits/stdc++.h>
using namespace std;
int a[55];
int main() {
  int T, n;
  cin >> T;
  while (T--) {
    cin >> n;
    set<int> s;
    int e = 0, o = 0;
    for (int i = 0; i < n; i++) {
      cin >> a[i];
      s.insert(a[i]);
      if (a[i] & 1)
        o++;
      else
        e++;
    }
    if (e & 1) {
      bool found = 0;
      for (int i = 0; i < n; i++) {
        if (!(a[i] & 1)) {
          if (s.find(a[i] + 1) != s.end() || s.find(a[i] - 1) != s.end())
            found = 1;
        }
      }
      if (found)
        puts("YES");
      else
        puts("NO");
    } else
      puts("YES");
  }
  return 0;
}
