#include<bits/stdc++.h>
using namespace std;
int a[100010];
int main(){
    int t;
    cin>>t;
    while(t--){
        int n,ans=0;
        cin>>n;
        priority_queue<int,vector<int>,greater<int>>q;
        for(int i=1;i<=n;i++)cin>>a[i],q.push(a[i]);

        while(q.size()>1){
            int m1=q.top();
            q.pop();
            int m2=q.top();
            q.pop();
            int k=m1+m2;
            int carry=0,res=0;
            while(m1||m2){
                int res=m1%10+m2%10+carry;
                if(res>=10)carry=1,ans++;
                else carry=0;
                m1/=10,m2/=10;
            }
            q.push(k);
        }
        cout<<ans<<endl;
        
    }
}