#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>

using namespace std;

const int N = 3e5 + 30;

int n, m, tot, T, t, a[N], c[N], ans, s;

void solve()
{
	for(int i = 1; i <= n; i ++) scanf("%d", &a[i]);
	sort(a + 1, a + n + 1);
	tot = 0; t = 0;
	for(int i = 1, j; i <= n; i = j + 1)
	{
		j = i;
		while(j < n && a[j + 1] == a[i]) j ++;
		if(j != n) c[++ tot] = j - i + 1;
	}
	reverse(c + 1, c + tot + 1);
	ans = n - tot; s = 0;
	priority_queue<int> q;
	for(int i = 1; i <= tot; i ++)
	{
		s ++; s -= c[i] + 1; ans ++;
		q.push(c[i] + 1);
		while(s < 0) s += q.top(), q.pop(), ans --;
	}
	printf("%d\n", ans);
}

int main()
{
	// freopen("pub.in", "r", stdin);
	// freopen("pub.out", "w", stdout);
	scanf("%d", &T);
	while(T --)
	{
		scanf("%d", &n); solve();
	}
	return 0;
}