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

int t, n, c, v[10], a[1050];

bool check(int x) {
    int cur = 0;
    for(int i = 0; i < 5; i++) {
        int m = INT_MAX, p = 0;
        for(int j = 1; j < 1024; j++) {
            if(a[j] >= x && !(cur & j) && a[j] < m) {
                m = a[j];
                p = j;
            }
        }
        if(p) cur |= p;
        else return false;
    }
    return true;
}

int main() {
    cin >> t;
    while(t--) {
        memset(v, 0, sizeof(v));
        memset(a, 0, sizeof(a));
        cin >> n;
        for(int i = 0; i < n; i++) {
            cin >> c;
            v[c % 10]++;
        }
        for(int i = 0; i < (1 << 10); i++) {
            for(int j = 1, k = 0; j <= i; j <<= 1, k++) {
                if(i & j) a[i] += v[k];
            }
        }
        int l = 1, r = n;
        while(l <= r) {
            int m = l + r >> 1;
            if(check(m)) l = m + 1;
            else r = m - 1;
        }
        cout << n - r << endl;
    }
}