#include<iostream>
#include<map>
#include<queue>
#define REP(i,n) for(int i=0;i<n;++i)
using namespace std;
int main(){
	int t; cin >> t;
	while (t--){
		map<int, int> mp;
		int n; cin >> n;
		REP(i,n){
			int l; cin >> l;
			mp[l]++;
		}
		priority_queue<int> pq;
		for (auto it : mp) pq.push(it.second);
		int ans = 0;
		while (pq.size() >= 3){
			ans++;
			int x[3];
			REP(i, 3) x[i] = pq.top(), pq.pop();
			REP(i, 3) if (x[i] > 1) pq.push(x[i] - 1);
		}
		cout << ans << endl;
	}
	return 0;
}