#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fir first
#define sec second
#define SZ(a) (int)((a).size())
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef double db;
typedef pair <int, int> Pii;
typedef pair <ll, int> Pli;
typedef unsigned long long ull;
const double eps = 1e-8;
const int mod = (int)(1e9) + 7;
const int inf = 0x7fffffff;
const int N = (int)(2e5) + 7;

int _, n, a[N];

// 值为 v 的有 cnt 个
struct node {
    int v, cnt;
    bool operator< (const node& ot) const {
        return cnt < ot.cnt;
    }
} nd[N];
int len;

// 数目为 cnt 的有 t 块
struct node1 {
    int cnt, t;
} nd1[N];
int len1;

// 后缀和 cnt_i * t_i, t_i
int mul[N], bck[N];

int main() {

    // freopen("in.in", "r", stdin);
    for (scanf("%d", &_); _; --_) {
        scanf("%d", &n);
        for (int i = 1; i <= n; ++i) {
            scanf("%d", &a[i]);
        }
        sort(a + 1, a + 1 + n);
        len = 0;
        for (int i = 1; i <= n; ++i) {
            if (a[i] != a[i - 1]) nd[++len].v = a[i], nd[len].cnt = 1;
            else ++nd[len].cnt;
        }
        sort(nd + 1, nd + 1 + len);
        
        // puts("nd[i]: ");
        // for (int i = 1; i <= len; ++i) {
        //     printf("(%d, %d)\n", nd[i].v, nd[i].cnt);
        // }
        // puts("\n-----------");

        len1 = 0;
        nd[0].cnt = 0;
        for (int i = 1; i <= len; ++i) {
            if (nd[i - 1].cnt != nd[i].cnt) 
                nd1[++len1].cnt = nd[i].cnt, nd1[len1].t = 1;
            else ++nd1[len1].t;
        }

        // puts("nd1[i]: ");
        // for (int i = 1; i <= len1; ++i) {
        //     printf("(%d, %d)\n", nd1[i].cnt, nd1[i].t);
        // }
        // puts("\n-----------");

        mul[len1 + 1] = bck[len1 + 1] = 0;
        for (int i = len1; i >= 1; --i) {
            mul[i] = mul[i + 1] + nd1[i].cnt * nd1[i].t;
            bck[i] = bck[i + 1] + nd1[i].t;
        }
        int pre = 0, res = n;
        for (int i = 1; i <= len1; ++i) {
            res = min(res, pre + mul[i + 1] - nd1[i].cnt * bck[i + 1]);
            pre += nd1[i].cnt * nd1[i].t;
        }
        printf("%d\n", res);
    }    

    return 0;
}