#include <stdio.h>
#include <stdlib.h>

int compare_int( const void*a, const void*b){
	int ta = *(int*)a;
	int tb = *(int*)b;
	return ta - tb; // tb-taだと降順
}

int main(void){
	int t;
	scanf("%d", &t);
	
	for(;t>0;t--){
		int i,n;
		int cnt=0;
		int L[110];
		
		scanf("%d", &n);
		
		for(i=0;i<n;i++){
			scanf("%d", &L[i]);
		}
		
		qsort(L, n, sizeof(int), compare_int);
		
		
		while(1){
			int a=0,b=0,c=0;
			int ap=-1,bp=-1,cp=-1;
			
			for(i=0;i<n;i++){
				if( a==0 && L[i] != 0 ){
					a = L[i];
					ap = i;
					continue;
				}
				
				if(b==0 && L[i] != 0 && L[i] != a){
					b = L[i];
					bp = i;
					continue;
				}
				
				if(c==0 && L[i] != 0 && L[i] != a && L[i] != b){
					c = L[i];
					cp = i;
					continue;
				}
			}
			
			if(c != 0){
				L[ap] = 0;
				L[bp] = 0;
				L[cp] = 0;
				cnt++;
			}else{
				break;
			}
		}
		
		printf("%d\n", cnt);
	}
	
	
	return 0;
}