#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pi = pair<ll,ll>;

#define all(x) (x).begin(), (x).end()
#define SORT(x) sort(all(x))
#define FOR(i, n) for (ll i = 0; (i) < (ll)(n); ++(i))
#define FOR3(i, m, n) for (ll i = (m); (i) < (ll)(n); ++(i))
#define fi first

void solve(){
	int N; cin>>N;
    vector<int> arr(N); for(auto&x: arr) cin>>x;
    SORT(arr);
    set<pair<int,int>> st;
    for(int i=0,j=0;i<N;){
        while(j<N&&arr[i]==arr[j])++j;
        st.emplace(j-i,arr[i]);
        i=j;
    }
    int ans=0;
    while(st.size()>2){
        ++ans;
        pair<int,int>p[3];
        FOR(i,3){
            p[i]=st.extract(*st.rbegin()).value();
        }
        FOR(i,3) if(--p[i].fi>0) st.emplace(p[i]); 
    }
    cout<<ans<<'\n';
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t=1; cin>>t;
    for(;t--;) solve();
}