#include <bits/stdc++.h>
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];
	sort(all(a));
	int group_cnt = 0, res = 1, group_siz = 0;
	int prev = -1, singletons = 0;
	loop(i, 0, n-1) {
		if(a[i] != prev) {
			if(singletons) {
				singletons--;
				res++;
			}
			if(group_siz == 1) {
				singletons++;
			}
			group_siz = 1;
			group_cnt++;
			prev = a[i];
		}
		else {
			group_siz++;
			res++;
		}
	}
	cout << res << '\n';
}

int main() {

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

	while(t--) solve();

}