#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();
}