#include<iostream>
#include<stdio.h>
#include<cstring>
#include<stdlib.h>
#include<math.h>
#include<algorithm>
#include<map>
#include<vector>
#include<queue>
#include<set>
#include<bitset>
#include<stack>
using namespace std;
#pragma comment(linker, "/STACK:10240000000,10240000000")
#define mem(x,k) memset(x,k,sizeof(x))
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
#define inf 0x3f3f3f3f
#define fi first
#define se second
#define pb push_back
#define ALL(v) v.begin(),v.end()
#define T_T for(int _=rd(),Case=1;Case<=_;Case++)
#define debug puts("======================")
typedef long long ll;
typedef pair<int,int> pii;
#define CHG ch=getchar()
#define FRD x=bo=0; for(CHG;ch<'0'||ch>'9';CHG) if(ch=='-')bo=1;
#define FR2 for(;ch>='0'&&ch<='9';x=(x<<1)+(x<<3)+ch-'0',CHG);
char ch; int bo;
inline bool blank(char ch){return ch==' '||ch=='\n'||ch=='\r'||ch=='\t';}
inline void rd(int &x){ FRD FR2 if (bo)x=-x; }
inline void RD(ll &x){ FRD FR2 if (bo)x=-x; }
inline ll RD(){ ll x; RD(x); return x; }
inline int rd(){ int x; rd(x); return x;}
inline void RD(char *s){///scanf %s
    for (CHG;blank(ch);CHG);
    for (;!blank(ch);CHG)*s++=ch; *s=0;
}
inline void RD(char &c){for(CHG;blank(c);CHG);}
inline void RD(double &x){ scanf("%lf",&x);}
template<class T> inline void OT(T x){
    static char buf[20];
    char *p1=buf;if(!x)*p1++='0';if (x<0)putchar('-'),x=-x;
    while(x)*p1++=x%10+'0',x/=10;
    while(p1--!=buf)putchar(*p1);
}
#define pe() puts("")
#define pk() putchar(' ')
#define wt(x) OT(x),pe();
#define wl(a,n) rep(_i,n) OT(a[_i]),putchar(" \n"[_i==n-1]);
const int maxn = 1e6 + 14;
int num[11];
int weight[3000];
int dp[3000][6];
int an;
const int mx = 1<<11;
int dfs(int sign, int day){
    if(day==5){
           // printf("%d\n",weight[mx-sign-1]);
        return weight[sign];
    }
    if(dp[sign][day]!=-1) return dp[sign][day];
  //  debug;
    dp[sign][day] = inf;
   // printf("%d.....\n",sign);
    for(int i=0;i<mx;i++){
        if((sign&i)==i){
                int nw = max(weight[i],dfs(sign-i, day+1));
            dp[sign][day] = min(dp[sign][day], nw);
        }
    }

 //   if(sign==mx-1-3)printf("___%d,%d\n",day, dp[sign][day]);
   // printf("%d %d:%d\n",sign,day, dp[sign][day]);
    return dp[sign][day];
}
int main(){
    int T=rd();
    while(T--){
                mem(weight,0);
        mem(dp,-1);
        int n=rd();
        mem(num,0);
        rep(i,n){
          char s[20];
          RD(s);
          num[s[4]-'0']++;
        }
        int tot =0;
        rep(i,10)tot+=num[i];
        rep(i,mx){
            int x = 0;
            rep(j,10)if((1<<j)&i) x+= num[j];
            weight[i] = tot -x;
        }
        wt(dfs(mx-1,1));
       // wt(an);
    }
}