Problem 1018. -- Big Number## HDU_1018: Big Number

Time Limit: 1000 MS Memory Limit: 32 MB 64bit IO Format: %I64d

Submitted: 20 Accepted: 12

[Submit][Status][Web Board]## Description

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

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.

## Output

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

## Sample Input

## Sample Output

[Submit][Status][Web Board]