 JMU Comp Pro Weekly Contest Week 8

#### Start

2019-11-08 11:30 AKST

## JMU Comp Pro Weekly Contest Week 8

#### End

2019-11-15 10:30 AKST
The end is near!
Contest is over.
Not yet started.
Contest is starting in -268 days 15:51:17

167:00:00

0:00:00

# Problem EHow Many Digits?

Often times it is sufficient to know the rough size of a number, rather than its exact value. For example, a human can reason about which store to visit to buy milk if one store is roughly $1$ kilometer away, and another store is roughly $100$ kilometers away. The exact distance to each store is irrelevant to the decision at hand; only the sizes of the numbers matter.

For this problem, determine the ‘size’ of the factorial of an integer. By size, we mean the number of digits required to represent the answer in base-$10$.

## Input

Input consists of up to $10\, 000$ integers, one per line. Each is in the range $[0,1\, 000\, 000]$. Input ends at end of file.

## Output

For each integer $n$, print the number of digits required to represent $n!$ in base-$10$.

Sample Input 1 Sample Output 1
0
1
3
10
20

1
1
1
7
19