#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<vector<ll>> vvl;
typedef vector<ll> vll;
#define F(i,a,n) for(ll i=a;i<n;i++)
#define mod 1000000007
#define mod2 998244353

#define INF (1e18)+5
bool sq(ll c){
	ll z=sqrt(c);
	if(z*z==c)return true;
	else return false;
}
bool cube_root(ll x){
	ll l=1ll,r=10000;
	while(l<=r){
		ll m=(l+r)/2;
		if(m*m*m==x){
			return true;
		}
		else if(m*m*m>x){
			r=m-1;
		}
		else {
			l=m+1;
		}
	}
	return false;
}
void solve(){
	ll n;
	cin>>n;
	vll v(n);
	map<ll,ll>m,m2;
	F(i,0,n){cin>>v[i];
	m[v[i]]++;
	}
	for(auto i:m){
		m2[i.second]++;
	}
	ll ans=0,s=0,y=0;
	vector<pll>x;
	for(auto i:m2){x.push_back(i);}
	sort(x.begin(),x.end(),greater<pll>());
	// for(auto i:x){cout<<i.first<<" "<<i.second<<endl;}
	for(auto i:x){
		ans=max(ans,s*i.first+i.second*i.first);
		s+=i.second;
		// y+=i.first;
		// cout<<ans<<" "<<i.second<<" ";
	}
	// ans=min(ans,n-s);

	cout<<n-ans<<endl;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	#ifndef ONLINE_JUDGE
		freopen("input.txt","r",stdin);
		freopen("output.txt","w",stdout);
	#endif
	ll w=1;
	cin>>w;
	F(i,0,w){
		solve();
	}
	return 0;
}