beecrowd | 3096
# Overflow

**Timelimit: 1**

By Ygor Ribeiro, IFSULDEMINAS Brazil

Ribeiro is very fond of factorial numbers, but recently he was calculating the factorial of some numbers and was not able to arrive at the final answer, since the number that was forming was with many digits and not even his calculator was able to help him.

The factorial of a number **N** is defined by **N**! = 1 * 2 * 3 * .. * **N**.

As Ribeiro saw that in many cases that he would try to find the factorial would result in overflow, he was content to know how many digits the factorial of **N** has.

Example: 5! is equal to 120, so the number of digits is 5! is 3.

Your task is to help Ribeiro and inform how many digits there is **N**!.

The entry contains an integer** N** (1 <= **N** <= 10^8) as explained the problem.

The output must contain the number of digits **N**!.

Input Samples | Output Samples |

5 |
3 |

10 |
7 |