#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <algorithm>
using namespace std;
 
const int maxn = 100000;
 
int n, a[maxn];
 
int main()
{
	int tests, test = 1;
	for (assert(scanf("%d", &tests) == 1 && 1 <= tests && tests <= 10); test <= tests; ++ test) {
		assert(scanf("%d", &n) == 1 && 1 <= n && n <= maxn);
		for (int i = 0; i < n; ++ i) {
			assert(scanf("%d", &a[i]) == 1 && 1 <= a[i] && a[i] <= maxn);
		}
		sort(a, a + n);
		int maxi = 0;
		for (int i = 0; i < n; ++ i) {
			int j = i;
			while (j < n & a[j] == a[i]) {
				++ j;
			}
			maxi = max(maxi, j - i);
			i = j - 1;
		}
		printf("%d\n", n - maxi);
	}
	return 0;
}