#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pi;
typedef pair<double, double> pd;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef vector<vector<pi>> vvpi;
typedef vector<pi> vpi;

ll INF = 2e18;
double eps = 1e-12;

#define forn(i, e) for (ll i = 0; i < e; i++)
#define forsn(i, s, e) for (ll i = s; i < e; i++)
#define rforn(i, s) for (ll i = s; i >= 0; i--)
#define rforsn(i, s, e) for (ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout << #x << " = " << x << ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())

void fast_cin()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

void read(vi &x)
{
    for (ll i = 0; i < sz(x); i++)
    {
        cin >> x[i];
    }
    return;
}

void read(vvi &x)
{
    for (ll i = 0; i < sz(x); i++)
    {
        for (ll j = 0; j < sz(x[i]); j++)
        {
            cin >> x[i][j];
        }
    }
    return;
}

void solve()
{
    ll n;
    cin >> n;
    vi a(n);
    read(a);
    sort(all(a));
    vi cnt;
    forn(i,n)
    {
        if(i==n-1 && a[i]!=a[i-1])
        {
            cnt.push_back(1);
            break;
        }
        ll cntr = 1;
        while(i<n-1 && a[i] == a[i+1])
        {
            cntr++;
            i++;
        }
        cnt.push_back(cntr);
    }
    sort(all(cnt));
    ll mn = 1e9;
    forn(i,cnt.size())
    {
        
        if(i>0 && cnt[i]==cnt[i-1])
            continue;
        mn = min(mn,ll( n - ((cnt.size() - i) * cnt[i])));
        // dbg(i);
    }
    cout << mn << ln;
}

int main()
{
// #ifndef ONLINE_JUDGE
//     freopen("input.txt", "r", stdin);
//     freopen("output.txt", "w", stdout);
// #endif
    fast_cin();
    ll t;
    cin >> t;
    for (int it = 1; it <= t; it++)
    {
        // cout << "Case #" << it + 1 << ": ";
        solve();
    }
    return 0;
}