#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int t;
main()
{
	cin>>t;
	for(;t--;)
	{
		int n,l[1000];
		cin>>n;
		for(int i=0;i<n;i++)cin>>l[i];
		sort(l,l+n);
		vector<int>a;
		int cnt=1,f=l[0];
		for(int i=1;i<n;i++)
		{
			if(f==l[i])cnt++;
			else
			{
				a.push_back(cnt);
				cnt=1;
				f=l[i];
			}
		}
		a.push_back(cnt);
		sort(a.begin(),a.end(),greater<int>());
		if(a.size()<3)
		{
			cout<<0<<endl;
		}
		else if(a[0]<=n/3)
		{
			cout<<n/3<<endl;
		}
		else if(a[1]<=(n-a[0])/2)
		{
			cout<<(n-a[0])/2<<endl;
		}
		else cout<<(n-a[0]-a[1])<<endl;
	}
}