#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
sort(a.begin(), a.end());
unordered_map<int, int> freq;
for (int i = 0; i < n; i++) {
freq[a[i]]++;
}
int l = 0, r = n - 1;
while (l < r && r >= 0 && l < n) {
if (freq[a[r]] % 2 == 0) {
r--;
} else {
if (freq[a[l]] == 1) {
cout << "NO" << endl;
return;
} else if (freq[a[l]] % 2 == 0) {
l++;
} else {
l++;
r--;
freq[a[l]]--;
freq[a[r]]--;
}
}
}
if (l == r) {
if (freq[a[l]] % 2 == 1) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
} else {
cout << "YES" << endl;
}
}
int main() {
int t;
cin >> t;
while (t--) solve();
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgp2b2lkIHNvbHZlKCkgewoJaW50IG47CgljaW4gPj4gbjsKCXZlY3RvcjxpbnQ+IGEobik7Cglmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKykgY2luID4+IGFbaV07Cglzb3J0KGEuYmVnaW4oKSwgYS5lbmQoKSk7Cgl1bm9yZGVyZWRfbWFwPGludCwgaW50PiBmcmVxOwoJZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKCQlmcmVxW2FbaV1dKys7Cgl9CglpbnQgbCA9IDAsIHIgPSBuIC0gMTsKCXdoaWxlIChsIDwgciAmJiByID49IDAgJiYgbCA8IG4pIHsKCQlpZiAoZnJlcVthW3JdXSAlIDIgPT0gMCkgewoJCQlyLS07CgkJfSBlbHNlIHsKCQkJaWYgKGZyZXFbYVtsXV0gPT0gMSkgewoJCQkJY291dCA8PCAiTk8iIDw8IGVuZGw7CgkJCQlyZXR1cm47CgkJCX0gZWxzZSBpZiAoZnJlcVthW2xdXSAlIDIgPT0gMCkgewoJCQkJbCsrOwoJCQl9IGVsc2UgewoJCQkJbCsrOwoJCQkJci0tOwoJCQkJZnJlcVthW2xdXS0tOwoJCQkJZnJlcVthW3JdXS0tOwoJCQl9CgkJfQoJfQoJaWYgKGwgPT0gcikgewoKCQlpZiAoZnJlcVthW2xdXSAlIDIgPT0gMSkgewoJCQljb3V0IDw8ICJOTyIgPDwgZW5kbDsKCQl9IGVsc2UgewoJCQljb3V0IDw8ICJZRVMiIDw8IGVuZGw7CgkJfQoJfSBlbHNlIHsKCQljb3V0IDw8ICJZRVMiIDw8IGVuZGw7Cgl9Cn0KCmludCBtYWluKCkgewoJaW50IHQ7CgljaW4gPj4gdDsKCXdoaWxlICh0LS0pIHNvbHZlKCk7Cn0=
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