#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs exit atof atoi 
#include <cstdio>		// require scanf printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>		// require fabs
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>		// require tolower, toupper
#include <fstream>	// require freopen
#include <ctime>		// require srand
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()
#define INF 1<<10

using namespace std;

typedef long long ll;
typedef pair<int, int> P;


int main()
{
	ios_base::sync_with_stdio(0);
	int T; cin >> T;
	while (T-- ){
		int N; cin >> N;
		map<int,int> cnt; cnt.clear();
		rep (i, N ){
			int lin; cin >> lin;
			cnt[lin]++;
		} // end rep
		priority_queue<int> a;
		map<int,int>::iterator it = cnt.begin();
		for (; it != cnt.end(); it++ ){
			int c = (*it).second;
			a.push (c );
		} // end for

		int res = 0;
		while (a.size() >= 3 ){
			int min_cnt = INF;
			int next_a[3] = {0};
			rep (i, 3 ){
				int curr = a.top(); a.pop();
				next_a[i] = curr;
				min_cnt = min (min_cnt, curr );
			} // end for
			res += min_cnt;
			rep (i, 3 ){
				if (next_a[i] - min_cnt > 0 ) 
					a.push (next_a[i] - min_cnt );	
			} // end rep
		} // end while

		cout << res << endl;
	} // end while

	return 0;
}