#include<bits/stdc++.h>
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define per(i,j,k) for(int i=j;i>=k;i--)
using namespace std;
const int N=3e5+5;
int T,n,a[N],xl[N];
signed main(){
    ios::sync_with_stdio(false);
    cin>>T;
    while(T--){
        cin>>n;
        rep(i,1,n) cin>>a[i];
        sort(a+1,a+n+1); int tot=0;
        per(i,n,1){
            int zz=i; while(a[i]==a[zz-1]) zz--;
            if(i!=n) xl[++tot]=i-zz+1; i=zz;
        }int ans=n-tot,gs=0; priority_queue<int> que;
        rep(i,1,tot){
            gs-=xl[i],ans++,que.push(xl[i]+1);
            while(gs<0) gs+=que.top(),que.pop(),ans--; 
        }cout<<ans<<'\n';
    }
}