#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
bool isPrime(long long n) {
  if (n < 2) return false;
  if (n < 4) return true;
  if (n % 2 == 0 or n % 3 == 0) return false;
  for (long long i = 5; i * i <= n; i += 6)
    if (n % i == 0 or n % (i + 2) == 0) return false;
  return true;
}
void swap(long long &a, long long &b) {
  long long t = a;
  a = b;
  b = t;
}
long long sumdigits(long long x) {
  long long sum = 0;
  while (x) {
    long long t = x % 10;
    sum += t;
    x /= 10;
  }
  return sum;
}
bool norep(long long x) {
  map<long long, long long> m;
  while (x) {
    long long t = x % 10;
    m[t]++;
    if (m[t] > 1) return false;
    x /= 10;
  }
  return true;
}
const long long N = 50;
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t;
  cin >> t;
  while (t--) {
    long long n, a[N];
    cin >> n;
    for (long long i = 0; i < n; i++) cin >> a[i];
    sort(a, a + n);
    bool flag = true;
    for (long long i = 0; i < n - 1; i++) {
      if (abs(a[i + 1] - a[i]) > 1) {
        flag = false;
        break;
      }
    }
    if (flag)
      cout << "YES"
           << "\n";
    else
      cout << "NO"
           << "\n";
  }
  return 0;
}
