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.   翻译： 大的数字 描述： 在许多的应用中需要非常大的数字。一些应用使用密钥为了安全传输数据、加密等。在这个问题中给你一个数字，你必须确定这个数字的阶乘的数位。 输入： 输入由几行整数构成。第一行包含整数n，这是要测试的情况的数量，后面有n行，每一行有一个整数1<=n<=107。 输出： 输出包含出现在输入中的整数的阶乘的数位。