#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 8e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
priority_queue<ll,vector<ll>,greater<ll> > q;
ll t,n,a[300030],lsh[300030],cnt=0,tot[300030];
int main(){
	t=read();
	while(t--){
		n=read();
		fr(i,1,n) lsh[++cnt]=a[i]=read();
		sort(lsh+1,lsh+cnt+1);
		cnt=unique(lsh+1,lsh+cnt+1)-lsh-1;
		fr(i,1,n) a[i]=lower_bound(lsh+1,lsh+cnt+1,a[i])-lsh;
		fr(i,1,n) tot[a[i]]++;
		ll now=1;
		fr(i,1,cnt){
			if(now){
				now--;
				q.push(tot[i]);
			}
			else{
				ll tmp=q.top();
				q.pop();
				tmp--;
				if(!tmp) now++;
				else q.push(tmp);
				q.push(tot[i]);
			}
		}
		ll ans=0;
		while(!q.empty()){
			ans+=q.top();
			q.pop();
		}
		writeln(ans);
		fr(i,1,cnt) tot[i]=0;
		cnt=0;
	}
}