#include<bits/stdc++.h>

using namespace std;
int n;
int a[300005];
inline int read(){
    int x = 0, t = 1;
    char ch=getchar(); 
    while(ch<'0'||ch>'9'){
        if(ch=='-')
            t=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9'){
        x=(x<<1)+(x<<3)+(ch^48);  
        ch=getchar();
    }
    return x*t;
}

void Solve(){
	n=read();
	for(int i=1;i<=n;i++)a[i]=read();
	sort(a+1,a+1+n);
	int hav=0,ans=0;
	priority_queue<int>q;
	for(int i=1;i<=n;i++){
		int j=i;
		while(j<n&&a[j+1]==a[i])j++;
		ans+=j-i+1;
		if(hav<0){
			hav=-q.top();
			q.pop();
		}
		if(hav)ans--;hav--;
		q.push(-(j-i+1));
		i=j;
	}
	printf("%d\n",ans);
}
int main(){
	int T;
	scanf("%d",&T);
	while(T--)Solve();
	return 0;
}