#include <bits/stdc++.h>
using namespace std;
int main(){
	int t;	cin>>t;
	while(t--){
		int n;	cin>>n;
		vector<int> l(n);
		map<int,int> data;
		for(int i=0;i<n;i++){
			cin>>l[i];
			data[l[i]]++;
		}
		priority_queue<int> pq;
		for(map<int,int>::iterator i=data.begin();i!=data.end();i++){
			pq.push(i->second);
		}
		if(pq.size()<3){
			cout<<0<<endl;
			continue;
		}
		int ans=0;
		while(1){
			int a=pq.top();	pq.pop();
			int b=pq.top(); pq.pop();
			int c=pq.top(); pq.pop();
			if(c<=0){
				cout<<ans<<endl;
				break;
			}
			ans++;
			pq.push(a-1);	pq.push(b-1);	pq.push(c-1);
		}
	}
	return 0;
}