#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-6;
void google(int i) { cout << "Case #" << i << ":" << endl; }
long long int prime[1000000 + 1];
void sieve(long long int n) {
  for (long long int i = 0; i < n + 1; i++) prime[i] = 1;
  for (long long int i = 2; i * i <= n; i++) {
    if (prime[i] != 1) continue;
    for (long long int j = i * i; j <= n; j = j + i)
      if (prime[i] == 1) prime[j] = i;
  }
}
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long int binarymul(long long int a, long long int n, long long int m) {
  long long int res = 1;
  while (n) {
    if (n % 2) {
      res = (res * a) % m;
      n--;
    }
    a = (a * a) % m;
    n /= 2;
  }
  return res;
}
void contest();
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  long long int t = 1;
  cin >> t;
  for (long long int i = 0; i < t; i++) {
    contest();
  }
  return 0;
}
void contest() {
  long long int n;
  cin >> n;
  long long int a[n];
  for (long long int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  bool flag = true;
  for (int i = 1; i < n; i++) {
    if (abs(a[i] - a[i - 1]) > 1) flag = false;
  }
  if (flag)
    cout << "YES";
  else
    cout << "NO";
  cout << endl;
}
