#include <bits/stdc++.h>
using namespace std;

int main() {
    int T;
    cin >> T;
    while (T--) {
        int N;
        map<int, int> cnt;
        cin >> N;
        while (N--) {
            int L;
            cin >> L;
            cnt[L]++;
        }

        priority_queue<int> que;
        for (auto& p : cnt)
            que.push(p.second);

        int ans = 0;

        while (que.size() >= 3) {
            int a[3] = {};
            for (int i = 0; i < 3; i++) {
                a[i] = que.top();
                que.pop();
            }
            for (int i = 0; i < 3; i++) {
                if (a[i] > 1)
                    que.push(a[i] - 1);
            }
            ans++;
        }

        cout << ans << endl;
    }
}