#include <bits/stdc++.h>
  
using namespace std;
  
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define fi first
#define se second
  
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
const int INF = 1e9;
const ll MOD = 1e9 + 7;
double EPS = 1e-8;

int main(){
    int t;
    cin >> t;
    while(t--) {
        int n;
        cin >> n;
        vector<int> v(n);
        rep(i, n) cin >> v[i];
        map<int, int> mp;
        rep(i, n) ++mp[v[i]];
        priority_queue<int> q;
        for(auto&& p : mp) q.push(p.se);
        int ans = 0;
        while(q.size() >= 3) {
            auto a = q.top(); q.pop();
            auto b = q.top(); q.pop();
            auto c = q.top(); q.pop();
            ++ans;
            if(a > 1) q.push(a-1);
            if(b > 1) q.push(b-1);
            if(c > 1) q.push(c-1);
        }
        cout << ans << endl;
    }
    return 0;
}