题目描述
Given integer n, find length of n! (which is factorial of n) excluding trailing zeros.
Input
The first line of the standard input contains one integer t (t<10001) which is the number of test cases.
In each of the next t lines there is number n (0 ≤ n ≤ 5*10^9).
Output
For each test, print the length of n! (which is factorial of n).
Constraints
1 ≤ t ≤ 10
1 ≤ n ≤ 10^9
SAMPLE INPUT
3
5
7
10
SAMPLE OUTPUT
2
3
5
输入格式
见题面
输出格式
见题面
样例输入
3
5
7
10
SAMPLE
样例输出
2
3
5