#include <cstdio>
#include <algorithm>

bool used[100];

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

    while(T--){
        int N;
        scanf("%d", &N);

        for(int i=0;i<N;i++){used[i] = false;}
    
        int L[100];
        for(int i=0;i<N;i++){
            scanf("%d", L+i);
        }

        std::sort(L, L+N);

        int res = 0;
        for(int i=1;i<=N/3;i++){
            bool can = true;
            for(int j=0,k=i,l=N-1;j<i;j++,k++,l--){
                while(k < N && L[k] <= L[j]){k++;}
                if(k == N || k >= l || L[k] >= L[l]){can = false; break;}
            }

            if(can){res = i;}
        }

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