#define _USE_MATH_DEFINES

#include <iostream>
#include <iomanip>

#include <algorithm>
#include <cmath>

#include <string>
#include <list>
#include <queue>
#include <vector>
#include <complex>
#include <set>

/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////

int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    //cout << setprecision(6);//
    
    int T,N,L[100],num[100],count,ans[1000];
	cin>>T;

	for(int Loop=0;Loop<T;++Loop){
		cin>>N;
		rep(i,N){
			cin>>L[i];
		}
		sort(L,L+N);
		count=0;
		rep(i,N){
			num[i]=0;
		}
		rep(i,N){
			if(i==0){
				++num[count];
			}else{
				if(L[i] != L[i-1]){
					++count;
				}
				++num[count];
			}
		}
		sort(num,num+count+1,greater<int>());
		ans[Loop]=0;
		for(int ka=0;3*ka < N;++ka)
		{
			int i,j,k;
			for(i=  0;i<count+1;++i){if(num[i]>0)break;}
			for(j=i+1;j<count+1;++j){if(num[j]>0)break;}
			for(k=j+1;k<count+1;++k){if(num[k]>0)break;}
			if( i<count+1 && j<count+1 && k<count+1){
				--num[i];
				--num[j];
				--num[k];
				++ans[Loop];
			}
			sort(num,num+count+1,greater<int>());
		}
	}

	rep(i,T){
		P(ans[i]);
	}
    
    return 0;
}