#include <bits/stdc++.h>
#define ls rt<<1
#define rs rt<<1|1
using namespace std;

typedef  long long ll;
const int inf = 0x3f3f3f3f;
const int maxn = 1000001;

int num[20];
int ans;
void dfs(int x, int q1, int q2, int q3, int q4, int q5) {
    if(x == 10) {
        int y = q1;
        y = min(y, q2);
        y = min(y, q3);
        y = min(y, q4);
        y = min(y, q5);
        ans = max(ans, y);
        return ;
    }
    dfs(x + 1, q1 + num[x], q2, q3, q4, q5);

    dfs(x + 1, q1, q2 + num[x], q3, q4, q5);

    dfs(x + 1, q1, q2, q3 + num[x], q4, q5);

    dfs(x + 1, q1, q2, q3, q4 + num[x], q5);

    dfs(x + 1, q1, q2, q3, q4, q5 + num[x]);
}
int main() {
    int t;
    scanf("%d", &t);
    while(t--) {
        int n;
        scanf("%d", &n);
        ans = 0;
        memset(num, 0, sizeof num);
        for(int i = 1; i <= n; i++) {
            int x;
            scanf("%d", &x);
            num[x % 10]++;
        }
        dfs(0, 0, 0, 0, 0, 0);
        cout << n - ans << endl;
    }
}