#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>

using namespace std;


int main(){
	int T;
	cin >> T;
	for(int t=0; t<T; t++){
		int N;
		cin >> N;
		vector<int> L(N);
		for(int i=0; i<N; i++) cin >> L[i];
		map<int, int> m;
		for(int i=0; i<N; i++){
			m[L[i]]++;
		}
		vector< pair<int,int> > v;
		for(auto itr = m.begin(); itr!=m.end(); itr++){
			v.push_back( {itr->second, itr->first} );
		}
		priority_queue< pair<int,int> > pq(v.begin(), v.end());
		int ans = 0;
		while(pq.size() >= 3){
			auto a = pq.top(); pq.pop();
			auto b = pq.top(); pq.pop();
			auto c = pq.top(); pq.pop();
			ans++;
			if(a.first > 1){
				pq.push( {a.first-1, a.second} );
			}
			if(b.first > 1){
				pq.push( {b.first-1, b.second} );
			}
			if(c.first > 1){
				pq.push( {c.first-1, c.second} );
			}
		}
		cout << ans << endl;
	}
	return 0;
}