#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

int N;
int a[100];

int main() {
	int T;
	cin >> T;
	
	while (T--) {
		
		scanf("%d", &N);
		REP(i, N) scanf("%d", a + i);
		
		map<int, int> m;
		REP(i, N) m[a[i]]++;
		
		priority_queue<int> pq;
		
		for (map<int, int>::iterator it = m.begin(); it != m.end(); ++it)
			pq.push(it->second);
		
		int ans = 0;
		
		while (pq.size() >= 3) {
			int cnt[3];
			REP(i, 3) {
				cnt[i] = pq.top();
				pq.pop();
			}
			ans++;
			
			REP(i, 3) if (cnt[i] - 1 > 0) pq.push(cnt[i] - 1);
		}
		cout << ans << endl;
	}
	return 0;
}