#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<set>

 #include<cmath>

 using namespace std;

 const int maxn = 1e7 + ;

 typedef long long ll;

 ll T, n, m;

 int main()

 {

     //for(int i = 2; i <= 10000000; i++)a[i] = a[i - 1] + log10(i);这样预处理是超内存的

     //a[1] = 1;

     cin >> T;

     while(T--)

     {

         cin >> n;

         if(n == )cout<<""<<endl;

         else

         {

             double tot = ;

             for(int i = ; i <= n; i++)

                 tot += log10(1.0 * i);

             int ans = ceil(tot);

             cout<<ans<<endl;

         }

     }

     return ;

 }