#include <bits/stdc++.h>
using namespace std;
int search(vector<int> vec,int n){
    for(int i=0;i<vec.size();i++){
        if(vec[i] == n) return i;
    }
    return -1;
}
int not0count(vector<int> vec){
    int ans = 0;
    for(int i=0;i<vec.size();i++){
        if(vec[i] != 0) ans++;
    }
    return ans;
}

int main(){
    int T;
    cin >> T;
    for(int i=0;i<T;i++){
        int N;
        int n;
        cin >> N;
        vector<int> num(N,0);
        vector<int> count(N,0);
        int p = 0;

        for(int j=0;j<N;j++){
            cin >> n;
            if(search(num,n) == -1){
                num[p] = n;
                count[p] = 1;
                p++;
            }else{
                count[search(num,n)]++;
            }
        }

        int ans = 0;

        while(not0count(count)>=3){
            vector<int>::iterator it = max_element(count.begin(),count.end());
            int maxindex = distance(count.begin(),it);
            count[maxindex]--;

            vector<int> temp = count;
            temp[maxindex] = 0;
            it = max_element(temp.begin(),temp.end());
            maxindex = distance(temp.begin(),it);
            count[maxindex]--;

            temp[maxindex] = 0;
            it = max_element(temp.begin(),temp.end());
            maxindex = distance(temp.begin(),it);
            count[maxindex]--;

            ans++;
        }

        cout << ans << endl;

    }

    return 0;
}