#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=1e6+5,M=N*4,K=600+5,mod=998244353,Mod=mod-1;const db eps=1e-6;const ll INF=1e18+7;mt19937 rnd(263082);
int n,m,A[N],B[N];
void Solve(){
	int i,j;scanf("%d",&n);
	for(i=1;i<=n;i++) scanf("%d",&A[i]);sort(A+1,A+n+1);
	fill(B+1,B+n+1,0);
	m=0;for(i=1;i<=n;i++) m+=(A[i]!=A[i-1]),B[m]++;
	int ans=n-(m-1);priority_queue<int> q;
	int sum=0;
	for(i=m-1;i;i--){
		q.emplace(-B[i]-1);
		sum+=B[i];ans++;
		while(sum>=-q.top()){
			sum+=q.top();q.pop();ans--;
		}
	}
	printf("%d\n",ans);
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}