#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, string> pls;

queue<ll> q;

int main()
{
	int T;  cin >> T;
	for (int i = 0; i < T; i++) {
		int N; cin >> N;
		vector<int> L(N);
		ll sum = 0;
		map<int, int> m;
		for (int j = 0; j < N; j++) {
			cin >> L[j];
			sum += L[j];
			m[L[j]]++;
		}

		priority_queue<int> pq;

		for (auto j : m) {
			pq.push(j.second);
		}

		if (m.size() < 3) {
			cout << 0 << endl;
			continue;
		}

		int ans = 0;
		while (1) {
			int a = pq.top(); pq.pop();
			int b = pq.top(); pq.pop();
			int c = pq.top(); pq.pop();
			if (c <= 0) {
				break;
			}
			ans++;
			pq.push(a - 1);
			pq.push(b - 1);
			pq.push(c - 1);
		}
		cout << ans << endl;
	}
	return	0;
}