#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr)
#define ll long long
#define fi first
#define se second
#define int long long
#define no "NO\n"
#define yes "YES\n"
#define pb push_back
#define endl "\n"
#define dbg(x...) do{cout<<#x<<" -> ";err(x);}while (0)
void err() { cout << '\n'; }

template<class T, class... Ts>
void err(T arg, Ts... args) {
    cout << arg << ' ';
    err(args...);
}

const int N = 5e5 + 7;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1.0);
int a[N],b[N],c[N],cnt;
string cal(string A, string B){
     int len = max(A.size(), B.size());
     for (int i = A.size() - 1, j = 1; i >= 0; i--, j++)
         a[j] = A[i] - '0';
     for (int i = B.size() - 1, j = 1; i >= 0; i--, j++)
         b[j] = B[i] - '0';
     for(int i=1;i<=len;i++) c[i]=0;
     for (int i = 1; i <= len; i++) {
         c[i] += a[i] + b[i];
         c[i + 1] = c[i] / 10;
         if(c[i+1]) cnt++;
         c[i] %= 10;
     }
     if (c[len + 1]) len++;
     string x;
     for (int i = len; i >= 1; i--)
         x+= (c[i]+'0');
     return x;
}
int e[N];
void  solve(){
	  int n;
	  cin >> n;
	  string s,sum;
	  for(int i=1;i<=n;i++){
	  	cin >> e[i];
	  }
	  sort(e+1,e+1+n);
	  sum = to_string(e[1]);
	  cnt=0;
	  for(int i=2;i<=n;i++){
        s = to_string(e[i]);
	  	sum = cal(sum,s);
	  }
	  cout << cnt << endl;
	  
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(nullptr),cout.tie(nullptr);
  	int T=1;
  	cin >>T;
  	while(T--) solve();
    return 0;
}