#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a*b/gcd(a,b);
}


signed main(void) {
    int i,j;
    int t;
    cin >> t;
    while(t--){
        int n;
        cin >> n;
        vi a(n);
        rep(i,n) cin >> a[i];
        sort(all(a));
        int cnt = 0;
        vi v(n,0);
        v[cnt]++;
        loop(i,1,n){
            if(a[i-1] != a[i])cnt++;
            v[cnt]++;
        }
        priority_queue<int> q;
        rep(i,n)if(v[i])q.push(v[i]);
        int ans = 0;
        while(q.size() >= 3){
            int x = q.top();q.pop();
            int y = q.top();q.pop();
            int z = q.top();q.pop();
            int t = min(x, min(y, z));
            x -= t;
            y -= t;
            z -= t;
            ans += t;
            if(x)q.push(x);
            if(y)q.push(y);
            if(z)q.push(z);
        }

        cout << ans << endl;
    }
}