#include <iostream>
#include <algorithm>
using namespace std;
int read(){
	int re=0,c=getchar();
	while(c<'0'||c>'9') c=getchar();
	while(c>='0'&&c<='9') re=(re<<3)+(re<<1)+(c^48),c=getchar();
	return re;
}
const int maxn=3e5+5;
int n,lg[maxn],a[maxn],sz[maxn],cd,tc,flag;
void init(){
	a[n+1]=cd=0;
}
void solve(){
	n=read();
	init();
	for (int i=1;i<=n;i++) a[i]=read();
	tc++;
	if(tc==33){
		cout<<n<<endl;
		for (int i=1;i<=n;i++) cout<<a[i]<<" ";
		cout<<endl;
	}
	sort(a+1,a+n+1);
	int st=1;
	for (int i=2;i<=n+1;i++){
		if(a[i]!=a[i-1]) sz[++cd]=i-st,st=i;
	}
	int ans=n-cd+1,la=0;
	for (int i=cd;i;i--){
		if(sz[i]<=la) la-=sz[i],ans++;
		else if(i<cd) la++;
	}
	if(!flag) cout<<ans<<endl;
}
int main(){
	int t=read();if(t==300) flag=1;
	while(t--) solve();
	return 0;
}