#include <bits/stdc++.h>
#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<list>
#include<queue>
#include<math.h>
#include<bitset>
using ll = long long;
using namespace std;


int main(){
    int t;
    cin >> t;
    priority_queue<int> pq;
    for (int i = 0; i < t; i++) {
        int t1, ans = 0, al1 = 0;
        cin >> t1;
        map<int, int> mp;
        for (int j = 0; j < t1; j++){
            int t2;
            cin >> t2;
            mp[t2]++;
        }

        for (auto itr = mp.begin(); itr != mp.end(); itr++){
            pq.push(itr->second);
        }
        while (pq.size() >= 3){
            ll a, b, c;
            
            a = pq.top();
            pq.pop();
            b = pq.top();
            pq.pop();
            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;
    }
}