#include<bits/stdc++.h>
#define debug(x) cerr<<#x<<" = "<<x
#define sp <<"  "
#define el <<endl
#define fgx cerr<<"-----------------------------------"<<endl
#define LL long long
#define DB double
#define pb push_back
using namespace std;
inline LL read(){
    LL nm=0; bool fh=1; char cw=getchar();
    for(;!isdigit(cw);cw=getchar()) fh^=(cw=='-');
    for(;isdigit(cw);cw=getchar()) nm=nm*10+(cw-'0');
    return fh?nm:-nm;
}
#define mod 1000000007
namespace  CALC{
    inline int add(int x,int y){return (x+y>=mod)?(x+y-mod):(x+y);}
    inline int mns(int x,int y){return (x-y<0)?(x-y+mod):(x-y);}
    inline int mul(LL x,LL y){return x*y%mod;}
    inline void upd(int &x,int y){x=(x+y>=mod)?(x+y-mod):(x+y);}
    inline void dec(int &x,int y){x=(x-y<0)?(x-y+mod):(x-y);}
    inline int qpow(int x,LL sq){LL res=1;for(;sq;sq>>=1,x=mul(x,x))if(sq&1)res=mul(res,x);return res;}
}using namespace CALC;
#define M 500200
int n,ct[10],ht,ans,hv[5];
inline void dfs(int k){
    if(k==10){
        int mx=0;
        for(int i=0;i<5;i++) mx=max(mx,n-hv[i]);
        ans=min(ans,mx); return ;
    }
    for(int i=0,TP=min(k+1,5);i<TP;i++) hv[i]+=ct[k],dfs(k+1),hv[i]-=ct[k];
}
inline void solve(){
    n=read(),memset(ct,0,sizeof(ct)),memset(hv,0,sizeof(hv));
    for(int i=1;i<=n;i++) ct[read()%10]++; ans=n;
    dfs(0);printf("%d\n",ans);
}
int main(){
    for(int Cas=read();Cas;--Cas) solve();
    return 0;
}