#include <cstdio>
#include <queue>
#include <unordered_map>

std::priority_queue<int> q;
std::unordered_map<int,int> m;

int main(){
    int T;
    scanf("%d", &T);

    while(T--){
        while(!q.empty()){q.pop();}
        m.clear();
        
        int N;
        scanf("%d", &N);
        
        for(int i=0;i<N;i++){
            int l;
            scanf("%d", &l);

            m[l]++;
        }

        for(const auto& p : m){
            q.push(p.second);
        }

        int res = 0;
        while(q.size() >= 3){
            res++;
            
            int xs[3];
            for(int i=0;i<3;i++){
                xs[i] = q.top();
                q.pop();
            }

            for(int i=0;i<3;i++){
                if(xs[i] > 1){q.push(xs[i]-1);}
            }
        }

        printf("%d\n", res);
    }
}