#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;
    int N;
    int c;
    int p = 0;
    cin >> T;
    for(int i=0;i<T;i++){
        vector<int> num(N,0),count(N,0);
        int ans=0;
        cin >> N;
        for(int j=0;j<N;j++){
            cin >> c;
            if(search(num,c) != -1){
                count[search(num,c)]++;
            }else{
                num[p] = c;
                count[p] = 1;
                p++;
            }  
        }
        int sum = 0;
        for(int j=0;j<N;j++) sum += count[j];
        while(sum >= 3 && not0count(count) >= 2){
            vector<int> flag(N,0);
            for(int j=0;j<3;j++){
                vector<int>::iterator it = max_element(count.begin(),count.end());
                int maxindex = distance(count.begin(),it);
                if(flag[maxindex] != 2){
                    count[maxindex]--;
                    flag[maxindex]++;
                }else{
                    vector<int> temp = count;
                    temp[maxindex] = 0;
                    it = max_element(temp.begin(),temp.end());
                    int maxindex2 = distance(count.begin(),it);
                    count[maxindex2]--;
                }
            }
            ans++;
        }
        cout << ans << endl;
    }
    return 0;
}