#include <bits/stdc++.h>
#define int long long
#define ff first
#define ss second
#define pb push_back
#define p_q priority_queue
#define INF 0x7FFFFFFF
#define den(a) cout << #a << " = " << a << "\n";
#define deg(a) cout << #a << " = " << a << " ";
using namespace std;
using TIII = tuple<int,int,int>;
using PII = pair<int, int>;

const int MOD = 1e9 + 7;
const double eps = 1e-9;

void solve()
{
    int n;
    cin >> n;
    vector<int> a(n + 1);
    for(int i = 1;i <= n;i ++) cin >> a[i];
    sort(a.begin() + 1,a.end());
    int ans = 0,la = 0;
    for(int i = 1;i <= 10;i ++)
    {
        ans += la;
        int temp = la;
        for(int j = 1;j <= n;j ++)
        {
            if(a[j] == 0) continue;
            int x = a[j] % 10;
            temp += x;
            a[j] /= 10;
        }
        la = temp / 10;
    }
    ans += la;

    cout << ans << '\n';
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);

    int T = 1;
    cin >> T;
    while (T--)
    {
        solve();
    }
    return 0;
}