#include<bits/stdc++.h>
using namespace std;

#define pb push_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
const int maxn = 3e5 + 70;
const int INF = 0x3f3f3f3f;
const ll inf = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1e9 + 7;
const double eps = 1e-7;
const double PI = acos(-1.0);

int n, m, k;

int cnt[10];

int sum[5], ans;

void dfs(int p){
    if(p == 10){
        ans = min(ans, n - *min_element(sum, sum+5));
        return;
    }

    for(int i=0;i<5;i++){
        sum[i] += cnt[p];
        dfs(p+1);
        sum[i] -= cnt[p];
    }
}

int main(){
    //freopen("in.txt", "r", stdin);
    int T; cin>>T;
    while(T--){
        memset(cnt,0,sizeof(cnt));
        cin>>n;
        for(int i=0;i<n;i++){int x; scanf("%d",&x); cnt[x%10]++;}

        ans = n; dfs(0);
        printf("%d\n",ans);
    }
    return 0;
}