347 人解决，405 人已尝试。
391 份提交通过，共有 1280 份提交。
2.1 EMB 奖励。
单点时限: 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.
2 5
0 1
347 人解决，405 人已尝试。
391 份提交通过，共有 1280 份提交。
2.1 EMB 奖励。