#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>

#define INF 1000000000

using namespace std;
typedef long long ll;


int main(void) {
    int T;
    cin >> T;
    while (T--) {
        map<int, int> m;
        int N;
        cin >> N;
        for (int i = 0; i < N; i++) {
            int l;
            cin >> l;
            m[l]++;
        }
        priority_queue<int> que;
        for (auto it = m.begin(); it != m.end(); it++) {
            que.push((*it).second);
        }
        ll ans = 0;
        while (que.size() >= 3) {
            int a = que.top(); que.pop();
            int b = que.top(); que.pop();
            int c = que.top(); que.pop();
            a--; b--; c--;
            if (a > 0) que.push(a);
            if (b > 0) que.push(b);
            if (c > 0) que.push(c);
            ans++;
        }
        cout << ans << endl;
    }
    return 0;
}