#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;
struct P{
	int v,id;
}ps[maxn];
int n,lg[maxn],a[maxn],sz[maxn],pos[maxn],cd,sl[maxn],sum[maxn][2];
void init(){
	a[n+1]=cd=0;
}
void pre(){
	for (int i=2;i<=3e5;i++) lg[i]=lg[i>>1]+1;
}
bool cmp(P x,P y){return x.v<y.v;}
int lowb(int x){return x&(-x);}
void upd(int p,int v){
	while(p<=cd) sum[p][0]++,sum[p][1]+=v,p+=lowb(p);
}
int fd(int x){
	int re=0,p=0;
	for (int i=lg[cd];i>=0;i--){
		int np=p+(1<<i);
		if(np<=cd&&sum[np][1]<=x) re+=sum[np][0],x-=sum[np][1],p=np;
	}
	return re;
}
void solve(){
	n=read();
	init();
	for (int i=1;i<=n;i++) a[i]=read();
	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;
	}
	for (int i=1;i<=cd;i++)
		sl[i]=sl[i-1]+sz[i],ps[i]=(P){sz[i],i},sum[i][0]=sum[i][1]=0;
	sort(ps+1,ps+cd+1,cmp);
	for (int i=1;i<=cd;i++) pos[ps[i].id]=i;
	int ans=n-cd+1;
	for (int i=1;i<=cd;i++)
	{
		upd(pos[i],sz[i]);
		if(sl[i]<cd-i-1) continue;
		int tp=fd(cd-i-1);
		ans=max(ans,n-(cd-i-1)-(i-tp));
	}
	cout<<ans<<endl;
}
int main(){
	int t=read();pre();
	while(t--) solve();
	return 0;
}