#include<bits/stdc++.h>
int f[10][2000],sum[2000];
signed main()
{
    int test;
    for ( scanf("%d",&test);test--; )
    {
        int n,tot[20]={0};scanf("%d",&n);memset(sum,0,sizeof(sum));
        for ( int i=1;i<=n;i++ ) { char ch[10]={'\0'};scanf(" %s",ch);tot[ch[4]^48]++; }
        int l=0,r=0;
        for ( int i=0;i<=9;i++ ) r+=tot[i],sum[1<<i]+=tot[i];
        int Sum=r;
        for ( int S=0;S<(1<<10);S++ ) sum[S]=sum[S-(S&(-S))]+sum[S&(-S)];
        while ( l<r )
        {
            int m=(l+r+1)>>1;bool flag=false;
//            printf("check at %d\n",m);
            memset(f,0,sizeof(f));f[0][0]=1;
            for ( int i=1;i<=5;i++ ) for ( int S=0;S<(1<<10);S++ )
            {
                for ( int T=S;T;T=S&(T-1) ) if ( sum[S^T]>=m ) f[i][S]|=f[i-1][T];
                if ( sum[S]>=m ) f[i][S]|=f[i-1][0];
            }
            for ( int S=0;S<(1<<10);S++ ) flag|=f[5][S];
            if ( flag ) l=m;
            else r=m-1;
        }
        printf("%d\n",Sum-l);
    }
    return 0;
}