#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <deque>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <sstream>
#include <utility>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
#define all(c) (c).begin(), (c).end()
#define loop(i,a,b) for(ll i=a; i<ll(b); i++)
#define rep(i,b) loop(i,0,b)
#define each(e,c) for(auto&e:c)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define lb lower_bound
#define ub upper_bound
#ifdef DEBUG
#define dump(...) (cerr<<#__VA_ARGS__<<" = "<<(DUMP(),__VA_ARGS__).str()<<" ["<<__LINE__<<"]"<<endl)
struct DUMP:ostringstream{template<class T>DUMP &operator,(const T&t){if(this->tellp())*this<<", ";*this<<t;return *this;}};
#else
#define dump(...)
#endif
template<class T> ostream& operator<<(ostream& os, vector<T> const& v){
    rep(i,v.size()) os << v[i] << (i+1==v.size()?"":" ");
    return os;
}

#include <map>
// syakyo
int main(){
    int t;
    cin>>t;
    while(t--){
        int N; cin >> N;
        vi L(N); rep(i,N) cin >> L[i];
        sort(all(L));
        vi cnt;
        rep(i,N){
            int k=1;
            while(i+1<N && L[i]==L[i+1]) k++,i++;
            cnt.pb(k);
        }

        int res = 0;
        while(1){
            sort(all(cnt));
            reverse(all(cnt));
            cnt.erase(remove(all(cnt),0), cnt.end());
            if(cnt.size()<3) break;
            res++;
            rep(i,3) cnt[i]--;
        }
        cout << res << endl;
    }
}