3233. N!

单点时限: 2.0 sec

内存限制: 256 MB

Give you an integer $n$, find the maximum $k$ that satisfies
$$n! \bmod 10^k = 0$$

输入格式

There are several test cases, please process till EOF.

For each test case, there is only one line contains integer $n$ $(1 \leq n \leq 10^9)$.

输出格式

For each test case, output the answer in one line.

样例

Input
2
5
Output
0
1

302 人解决,346 人已尝试。

334 份提交通过,共有 1002 份提交。

2.1 EMB 奖励。

创建: 3 年,8 月前.

修改: 3 年,5 月前.

最后提交: 2 周,2 天前.

来源: 2017 华东理工上海高校邀请赛

题目标签