#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define ITER(c)             __typeof__((c).begin())
#define FOREACH(it, c)      for (ITER(c) it=(c).begin(); it != (c).end(); ++it)
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))
const int MOD = 1000000007;

int solve(const VI &A){
    int N = A.size();
    map<int,int> m;
    int c = 0;
    REP(i,N) m[A[i]]++;
    priority_queue<pair<int,int> > q;
    FOREACH(it, m){
        q.push(make_pair(it->second, it->first));
    }
    while(1){
        pair<int,int> a[3];
        REP(i,3){
            if(q.size() == 0) return c;
            a[i] = q.top(), q.pop();
        }
        REP(i,3){
            a[i].first--;
            if(a[i].first > 0){
                q.push(a[i]);
            }
        }
        c++;
    }
    return c;
}

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

    REP(i,T){
        int N; cin >> N;
        VI v;
        REP(j,N){
            int a; cin >> a;
            v.push_back(a);
        }
        cout << solve(v) << endl;
    }
    return 0;
}