#include <iostream>
#include <algorithm>
#include <queue>
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;
struct P{
	int v,id;
}ps[maxn];
int n,lg[maxn],a[maxn],sz[maxn],del[maxn],lp[maxn],rp[maxn],cd,tc,flag;
priority_queue<int> pq;
void init(){
	a[n+1]=cd=0;
	while(!pq.empty()) pq.pop();
}
bool cmp(P x,P y){
	if(x.v!=y.v) return x.v<y.v;
	return x.id>y.id;
}
void solve(){
	n=read();
	init();
	for (int i=1;i<=n;i++) a[i]=read();
	/*tc++;
	if(flag&&tc==174){
		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]+1<=la) la-=sz[i]+1,pq.push(sz[i]+1),ans++;
		else if(!pq.empty()&&sz[i]+1<pq.top())
			la+=pq.top(),pq.pop(),la-=sz[i]+1,pq.push(sz[i]+1);
		la++;
	}
	/*for (int i=1;i<=cd;i++) del[i]=0,lp[i]=i-1,rp[i]=i+1,ps[i]=(P){sz[i],i};
	sort(ps+1,ps+cd+1,cmp);
	int ans=n-cd+1,dr=cd-1;
	for (int i=1;i<=cd;i++){
		int lc=0,tp=dr;
		while(tp>ps[i].id&&lc<ps[i].v) lc++,tp=lp[tp];
		cout<<ps[i].id<<" "<<dr<<" "<<lc<<endl;
		if(lc<ps[i].v) continue;
		ans++;
		while(lc) cout<<dr<<" ",del[dr]=1,dr=lp[dr],lc--;
		cout<<ps[i].id<<endl;
		del[ps[i].id]=1,lp[rp[ps[i].id]]=lp[ps[i].id],rp[lp[ps[i].id]]=rp[ps[i].id];
		if(dr==ps[i].id) dr=lp[dr];
	}
	cout<<endl;*/
	cout<<ans<<endl;
}
int main(){
	int t=read();//if(t==300) flag=1;
	while(t--) solve();
	return 0;
}