#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define loop(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
void solve() {
int n;
cin >> n;
vector<int> a(n);
unordered_map<int, int> freq;
loop(i, 0, n)
{
cin >> a[i];
freq[a[i]]++;
}
sort(a.begin(), a.end());
int prev = a[0];
for (int i = 1; i < n; i++) {
if (a[i] != prev) {
int diff = a[i] - prev;
if (freq[prev] >= 2) {
if (freq[prev] - 1 >= diff * 2) {
freq[a[i]] += freq[prev] - 2 - (diff - 1) * 2;
} else if (freq[prev] & 1) {
cout << "NO" << endl;
return;
}
} else {
cout << "NO" << endl;
return;
}
prev = a[i];
}
}
cout << "YES" << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) solve();
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgp1c2luZyBsbCA9IGxvbmcgbG9uZzsKCiNkZWZpbmUgbG9vcChpLCBhLCBiKSBmb3IgKGludCAoaSkgPSAoYSk7IChpKSA8IChiKTsgKGkpKyspIAoKdm9pZCBzb2x2ZSgpIHsKCWludCBuOwoJY2luID4+IG47Cgl2ZWN0b3I8aW50PiBhKG4pOwoJCgl1bm9yZGVyZWRfbWFwPGludCwgaW50PiBmcmVxOwoJbG9vcChpLCAwLCBuKSAKCXsKCQljaW4gPj4gYVtpXTsKCQlmcmVxW2FbaV1dKys7Cgl9Cglzb3J0KGEuYmVnaW4oKSwgYS5lbmQoKSk7CgoJaW50IHByZXYgPSBhWzBdOwoJZm9yIChpbnQgaSA9IDE7IGkgPCBuOyBpKyspIHsKCQlpZiAoYVtpXSAhPSBwcmV2KSB7CgkJCQoJCQlpbnQgZGlmZiA9IGFbaV0gLSBwcmV2OyAKCQkJCgkJCWlmIChmcmVxW3ByZXZdID49IDIpIHsKCQkJCQoJCQkJaWYgKGZyZXFbcHJldl0gLSAxID49IGRpZmYgKiAyKSB7CgkJCQkJCgkJCQkJZnJlcVthW2ldXSArPSBmcmVxW3ByZXZdIC0gMiAtIChkaWZmIC0gMSkgKiAyOwkKCQkJCQkKCQkJCX0gZWxzZSBpZiAoZnJlcVtwcmV2XSAmIDEpIHsKCQkJCQljb3V0IDw8ICJOTyIgPDwgZW5kbDsKCQkJCQlyZXR1cm47CgkJCQl9CgkJCQkKCQkJfSBlbHNlIHsKCQkJCWNvdXQgPDwgIk5PIiA8PCBlbmRsOwoJCQkJcmV0dXJuOwoJCQl9CgkJCQoJCQlwcmV2ID0gYVtpXTsKCQl9IAoJfQoJY291dCA8PCAiWUVTIiA8PCBlbmRsOwp9IAoKaW50IG1haW4oKSB7Cglpb3M6OnN5bmNfd2l0aF9zdGRpbyhmYWxzZSk7CgljaW4udGllKG51bGxwdHIpOyAKCWludCB0OwoJY2luID4+IHQ7Cgl3aGlsZSAodC0tKSBzb2x2ZSgpOwp9
OQoyCjEgMQoyCjIgMQo0CjEgMSA0IDQKNAozIDQgMyAzCjQKMiAzIDQgNAo2CjMgMyA0IDUgMyAzCjYKMiAyIDIgNCA0IDQKOAoxIDEgMSAxIDEgMSAxIDQKMTAKOSA5IDkgMTAgMTAgMTAgMTAgMTAgMTAgMTAK
9
2
1 1
2
2 1
4
1 1 4 4
4
3 4 3 3
4
2 3 4 4
6
3 3 4 5 3 3
6
2 2 2 4 4 4
8
1 1 1 1 1 1 1 4
10
9 9 9 10 10 10 10 10 10 10