#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;

#define RREP(i,s,e) for (i = e-1; i >= s; i--)
#define rrep(i,n) RREP(i,0,n)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)
#define INF 1e8

typedef long long ll;

int main() {
    int i, j, t;
    cin >> t;
    rep (i,t) {
        int n, mx = 0, ans = 0;
        map<int,int> m;
        vector<int> val;
        cin >> n;
        rep (j,n) {
            int l;
            cin >> l;
            m[l]++;
        }
        for (auto p : m)
            val.push_back(p.second);
        sort(val.begin(),val.end(),greater<int>{});
        while (val.size() >= 3 && val[2] > 0) {
            ans++;
            val[0]--;
            val[1]--;
            val[2]--;
            sort(val.begin(),val.end(),greater<int>{});
        }
        cout << ans << endl;
    }
    return 0;
}