#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fora(i, x, n) for(int i = x; i < n; i++)
#define fors(i, x, n) for(int i = x; i >= n; i--)
#define vi vector<int>
#define vll vector<ll>
#define vd vector<double>
#define vpii vector<pair< int, int > >
#define vpll vector<pair< long long, long long > >
#define vvi vector<vector< int > >
#define vs vector<string>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define seti set<int> 
#define setll set<long long>
#define mii map<int, int>
#define mll map<long long, long long>
#define pb push_back
#define mkp make_pair
#define fs first
#define ss second
#define minele *min_element
#define maxele *max_element 

void solve(){
	int n;
	cin >> n;

	vi a(n);
	mii mp;

	fora(i, 0, n){
		int x;
		cin >> x;
		mp[x]++;
		a[i] = x;
	}

	int s = 0, m = 0;
	for(auto i : mp){
		s += i.ss;
		m = max(m, i.ss);
	}

	if(m > s-m){
		cout << m - (s-m) << "\n";
		return;
	}

	if(n % 2)
		cout << "1\n";
	else
		cout << "0\n";
	
	return;
}
 
int main(){
	
ios_base::sync_with_stdio(false);
cin.tie(NULL);
 
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
 
	int t;
	cin >> t;

	while(t--)
		solve();
	
	return 0;
}	