#include <iostream>
#include <cstring>
#include <algorithm>
#include <set>
using namespace std;

int num[15], tong[5];
int mid;

bool judge(int i = 0) {
    if (i >= 10) {
        for (int x = 0; x < 5; x++) if (tong[x] < mid) return false;
        return true;
    }
    bool flag = true;
    for (int x = 0; x < 5; x++) {
        if (tong[x] >= mid) continue;
        flag = false;
        tong[x] += num[i];
        bool f = judge(i + 1);
        tong[x] -= num[i];
        if (f) return true;
    }
    return flag;
}

char s[5];
int main() {
    int T; scanf("%d", &T);
    while (T--) {
        int n; scanf("%d", &n);
        memset(num, 0, sizeof num);
        for (int i = 1; i <= n; i++) {
            scanf("%s", s);
            num[s[4] - '0']++;
        }
        int l = 0, r = n / 5;
        while (l <= r) {
            mid = (l + r) / 2;
            if (judge()) l = mid + 1;
            else r = mid - 1;
        }
        cout << n - l + 1 << endl;
    }
}