Big Number

描述
In many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you are given a number, you have to determine the number of digits in the factorial of the number.
输入
Input consists of several lines of integer numbers. The first line contains an integer n, which is the number of cases to be tested, followed by n lines, one integer 1 ≤ n ≤ 107 on each line.
输出
The output contains the number of digits in the factorial of the integers appearing in the input.
样例
样例输入 #1
2
10
20
样例输出 #1
7
19
来源
Asia 2002, Dhaka (Bengal)
HDOJ-1018
题目来源:HDOJ-1018
时间限制:1000 MS
内存限制:32768 KB
Java 类名:Main
64 位整数占位符:%I64d