#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using pi=pair<int,int>;
#define fi first
#define se second
const int N=3e5+5;
int n,m,a[N],b[N];
void solve() {
	cin>>n,m=0;
	for(int i=1;i<=n;i++)cin>>a[i],b[i]=0;
	sort(a+1,a+n+1);
	for(int i=1;i<=n;i++)m+=a[i]!=a[i-1],b[m]++;
	int t=0,s=0;
	priority_queue<int>q;
	for(int i=m-1;i;i--) {
		if(b[i]<=s)s-=b[i],q.push(b[i]),t++;
		else if(q.size()&&q.top()>b[i])s+=q.top()-b[i]+1,q.pop(),q.push(b[i]);
		else s++;
	}
	cout<<n-m+1+t<<'\n';
}
int main() {
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int tt;cin>>tt;
	while(tt--)solve();
	return 0;
}