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

#define loop(i, a, b) for(int i = a; i <= b; i++)
#define loop_rev(i, a, b) for(int i = a; i >= b; i--)
#define sz(x) int(x.size())
#define all(x) x.begin(), x.end()
using ui = uint32_t;
using ll = int64_t;

void solve() {
	int n; cin >> n;
	vector<int> a(n);
	loop(i, 0, n-1) cin >> a[i];
	a.push_back(0);
	sort(all(a));
	priority_queue<int> pq;
	int hole_cnt = -1, group_size = 1;
	int prev = -1, res = 1;
	loop_rev(i, n, 0) {
		if(a[i] != prev) {
			prev = a[i];
			if(group_size <= hole_cnt - 1) {
				hole_cnt -= group_size + 1;
				pq.push(group_size);
			}
			else if(!pq.empty() && group_size < pq.top()) {
				pq.pop();
				pq.push(group_size);
			}
			res += group_size - 1;
			group_size = 1;
			hole_cnt++;
		}
		else {
			group_size++;
		}
	}
	cout << (res + pq.size()) << '\n';
}

int main() {

	cin.tie(0)->sync_with_stdio(false);
	int t; cin >> t;

	while(t--) solve();

}