提示: 欢迎访问OurACM平台。
Problem 1050 Number lengths

Accept: 1109    Submit: 2285
Time Limit: 1000 mSec    Memory Limit : 32768 KB

Problem Description

N! (N factorial) can be quite irritating and difficult to compute for large values of N. So instead of calculating N!, I want to know how many digits are in it. (Remember that N! = N * (N - 1) * (N - 2) * ... * 2 * 1)

Input

Each line of the input will have a single integer N on it 0 < N < 1000000 (1 million). Input is terminated by end of file.

Output

For each value of N, print out how many digits are in N!.

Sample Input

1 3 32000

Sample Output

1 1 130271

Submit  Back  Status  Discuss