#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int T; cin >> T;
    rep(_,T){
        int n; cin >> n;
        map<int,int> mp;
        rep(i,n){
            int l; cin >> l;
            mp[l]++;
        }
        int ma = 0, ma2 = 0;
        for(auto p : mp){
            int x = p.second;
            if(x > ma){
                ma2 = ma;
                ma = x;
            }else{
                ma2 = max(ma2, x);
            }
        }
        int ans = min(n/3,min((n-ma)/2, (n-ma-ma2)));
        cout << ans << endl;
    }
    return 0;
}