#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

int main() {
    
    int T;
    cin >> T;

    vector<int> Ans;

    int N;
    for ( int i = 0; i < T; i++ ) {
        int ans = 0;

        cin >> N;
        vector<long long> L(N);

        for ( int j = 0; j < N; j++ ) {            
            cin >> L[j];
        }
        sort( L.begin(), L.end() );

        int cnt = 1;
        priority_queue<int> A;

        for ( int j = 1; j < N; j++ ) {            
            if ( L[j] == L[j-1] ) { cnt++; }
            else { A.push(cnt); cnt = 1; }
        }
        A.push(cnt);

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

        Ans.push_back(ans);
    }
    
    for ( int i = 0; i < T; i++ ) {
        cout << Ans[i] << endl;
    }


    return 0;
}