翻译（13）

题目：Big number | JXNUOJ

描述：

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 ≤ 10^7 on each line.

输入几行整数。第一行包括一个整数n，即测试数据的组数。接下来的n行，每行一个整数范围：1 ≤ n ≤ 10^7

输出：

The output contains the number of digits in the factorial of the integers appearing in the input.

输出包括输入的整数的阶乘的位数。