#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <stack>
#include <set>
#include <queue>
#include <string>
#include <deque>
#include <iomanip>
#include <map>
#include <ctime>  

using namespace std;

typedef long long ll;

ll bin_pow(ll a, ll n) {
	if (n == 0)
		return 1;

	if (n % 2 == 0) {
		ll b = bin_pow(a, n / 2);
		return b * b;
	}
	else return bin_pow(a, n - 1) * a;
}
ll gcd(ll a, ll b) {
	if (b == 0)
		return a;
	return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

vector<ll>arr;
vector<ll>pref;

void create_pref() {
	pref.resize(arr.size() + 1);
	pref[0] = 0;
	for (int i = 1; i < pref.size(); i++) {
		pref[i] = pref[i - 1] + arr[i - 1];
	}
}

ll ans1(int i) {
	return pref[i];
}

ll ans2(int i) {
	return (pref.back() - pref[i + 1]) - (arr[i] * (arr.size() - i - 1));
}

int main() {
	int t; cin >> t;
	while (t--) {
		int n; cin >> n;
		map<int, ll>m;
		for (int i = 0; i < n; i++) {
			int a; cin >> a;
			m[a]++;
		}
		for (auto i : m)
			arr.push_back(i.second);
		sort(arr.begin(), arr.end());
		create_pref();
		ll ans = 1e18;
		for (int i = 0; i < arr.size(); i++) {
			ans = min(ans, ans1(i) + ans2(i));
		}
		cout << ans << '\n';
		arr.clear();
		pref.clear();
	}
	return 0;
}