#include <bits/stdc++.h>   #pragma GCC optimize(2)   using namespace std;   const int maxn = 2e5 + 10, mod = 1e9 + 7, inf = 0x3f3f3f3f;   int n, a[maxn];   int main() {     ios::sync_with_stdio(0);     cin.tie(0);     int _t;     cin >> _t;     while (_t--) {       cin >> n;       for (int i = 1; i <= n; i++) cin >> a[i];       bool isok = true;       sort(a + 1, a + 1 + n);       for (int i = 2; i <= n; i++)         if (a[i] - a[i - 1] > 1) isok = false;       (isok ? cout <<  YES n  : cout <<  NO n );     }     return 0;   }   