#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <vector>
#include <deque>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stdio.h>
#include <cstdlib>
#include <random>
#include <chrono>
#include <fstream>
using namespace std;
typedef unsigned long long int ul;
typedef long long int ll;
typedef long double ld;
mt19937 rng((unsigned int)chrono::steady_clock::now().time_since_epoch().count());
#define mod 1000000007LL
#define sgraph 100100LL
#define segment 800100LL
#define all(V) V.begin(),V.end()
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll T;
    cin>>T;
    while(T--){
        ll n;
        cin>>n;
        vector<ll> a(n);
        set<ll> st;
        map<ll,ll> mp;
        for(ll i=0;i<n;i++){
            cin>>a[i];
            st.insert(a[i]);
        }
        ll itr=0;
        while(st.size()){
            mp[*st.begin()]=itr++;
            st.erase(st.begin());
        }
        vector<ll> hash(itr);
        for(ll i=0;i<n;i++){
            a[i]=mp[a[i]];
            hash[a[i]]++;
        }
        ll ans=n;
        sort(all(hash));
        ll prev=0,cur=0;
        for(ll i=0;i<itr;i++){
            ll j=i;
            while(j<itr&&hash[i]==hash[j]){
                j++;
            }
            ans=min(ans,n-((itr-i)*hash[i]));
            i=j-1;
        }
        cout<<ans<<"\n";
        
    }
}
