#include <iostream>
#include <cstdio>
#include <string>
#include <sstream>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>

#define PI 3.14159265359

#define INF 99999999;

#define rep(i, n) for(int i=0; i<n; i++)
#define REP(n) rep(i, n)

#define EPS 1e-10

typedef long long ll;

using namespace std;



/*
class TheKingsArmyDiv2
{
public:
	int getNumber(vector <string> state)
	{

	}
};
*/


int main()
{
	int T, N, L;
	map<int, int> lmap;
	vector<int> vi;
	
	cin >> T;
	rep(i, T)
	{
		cin >> N;
		
		lmap.clear();
		vi.clear();
		
		rep(j, N)
		{
			cin >> L;
			lmap[L]++;
		}
		
		map<int, int>::iterator it = lmap.begin();
		while (it != lmap.end())
		{
			vi.push_back((*it).second);
			it++;
		}
		
		sort(vi.begin(), vi.end(), greater<int>());
		
		int ret = 0;
		while (vi[2] != 0 && vi.size() >= 3)
		{
			vi[0]--; vi[1]--; vi[2]--;
			ret++;
			sort(vi.begin(), vi.end(), greater<int>());
		}
		
		cout << ret << endl;
		
		/*
		REP(vi.size())
		{
			cout << vi[i] << " ";
		}
		*/
	}
	
	return 0;
}