#include <iostream>
#include <sstream>
#include <math.h>
#include <vector>
#include <array>
#include <algorithm>
#include <queue>
#include <numeric>
#include <map>
#include <set>

using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define SUM(a) accumulate(ALL(a), 0)
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

typedef pair<int, int> pos;
int pos::*x = &pos::first;
int pos::*y = &pos::second;

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

int T, N;

signed main()
{
    cin >> T;
    vector<int> ans;
    REP(t,T) {
        map<int, int> take;
        cin >> N;
        int l;
        REP(i,N) {
            cin >> l;
            take[l]++;
        }
        priority_queue<int> pq;
        for(auto& t : take) {
            pq.push(t.second);
        }

        int cnt = 0;
        int top[3];
        while (pq.size() >= 3) {
            REP(i,3) {
                top[i] = pq.top();
                pq.pop();
                top[i]--;
            }
            REP(i,3) {
                if (top[i]) pq.push(top[i]);
            }
            cnt++;
        }
        ans.push_back(cnt);
    }
    REP(i,ans.size()) cout << ans[i] << endl;
    return 0;
}