#include<algorithm>
#include<complex>
#include<ctype.h>
#include<iomanip>
#include<iostream>
#include<fstream>
#include<map>
#include<math.h>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<stdio.h>
#include<string>
#include<string>
#include<vector>

using namespace std;
typedef long long ll;

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

const ll mod = 1e9 + 7;
const ll inf = 1e18;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll T;
    cin >> T;

    ll N;

    FOR(t, 0, T){
        cin >> N;

        map<ll, ll> mp;
        FOR(i, 0, N){
            ll a;
            cin >> a;
            mp[a]++;        
        }

        priority_queue<ll> que;
        for(auto p : mp){
            que.push(p.second);
        }

        ll count = 0;
        while(que.size()>=3){
            ll a = que.top(); que.pop();
            ll b = que.top(); que.pop();
            ll c = que.top(); que.pop();

            a--;
            b--;
            c--;
            count++;

            if(a>0) que.push(a);
            if(b>0) que.push(b);
            if(c>0) que.push(c);
        }
        p(count);
    }
    
    return 0;
}