#include <bits/stdc++.h>
using namespace std;

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int &ai : a)
      cin >> ai;

    vector<int> c(n);
    auto z = pair{-1, -1};
    sort(a.begin(), a.end());
    for (int ai : a) {
      if (ai != z.second)
        z = {z.first + 1, ai};
      c[z.first]++;
    }
    while (c.back() == 0)
      c.pop_back();
    c.pop_back();

    priority_queue<int,vector<int>,greater<int>> pq;
    int v = 0;
    for (int ci : c)
      for (pq.push(ci); pq.size() > v; v++) {
        int x = pq.top() - 1;
        pq.pop();
        if (x > 0)
          pq.push(x);
      }
    cout << n - v << '\n';
  }
  return 0;
}