/*
	Solution By - Amrutansu Garanaik
	Codechef ID - dragonemperor
*/
 
#include<stdio.h>
#include<math.h>
#define MAX 1000000
long long ans[MAX];
void preprocess()
{
	long double var=0,temp;
	ans[0]=1;
	for(int i=1;i<MAX;i++)
	{
		temp=log(i)/log(10);
		var+=temp;
		ans[i]=(long long)var+1;
	}
}
int main()
{
	preprocess();
	long long test,n;
	scanf("%lld",&test);
	while(test--)
	{
		scanf("%lld",&n);
		printf("%lld\n",ans[n]);
	}
	return 0;
}

LyoKCVNvbHV0aW9uIEJ5IC0gQW1ydXRhbnN1IEdhcmFuYWlrCglDb2RlY2hlZiBJRCAtIGRyYWdvbmVtcGVyb3IKKi8KCiNpbmNsdWRlPHN0ZGlvLmg+CiNpbmNsdWRlPG1hdGguaD4KI2RlZmluZSBNQVggMTAwMDAwMApsb25nIGxvbmcgYW5zW01BWF07CnZvaWQgcHJlcHJvY2VzcygpCnsKCWxvbmcgZG91YmxlIHZhcj0wLHRlbXA7CglhbnNbMF09MTsKCWZvcihpbnQgaT0xO2k8TUFYO2krKykKCXsKCQl0ZW1wPWxvZyhpKS9sb2coMTApOwoJCXZhcis9dGVtcDsKCQlhbnNbaV09KGxvbmcgbG9uZyl2YXIrMTsKCX0KfQppbnQgbWFpbigpCnsKCXByZXByb2Nlc3MoKTsKCWxvbmcgbG9uZyB0ZXN0LG47CglzY2FuZigiJWxsZCIsJnRlc3QpOwoJd2hpbGUodGVzdC0tKQoJewoJCXNjYW5mKCIlbGxkIiwmbik7CgkJcHJpbnRmKCIlbGxkXG4iLGFuc1tuXSk7Cgl9CglyZXR1cm4gMDsKfQ==

Mgo1Cjk=

2
5
9