Sifar

Interview

Time limit1sMemory limit128 MB

Summary

For each N up to 1,000,000 given one per line until 0, print the count of trailing zeros of N! as Case #x: M.

Problem

Given $N$ , print the largest $M$ such that $N!$ is divisible by $10^M$ .

The input has several lines. Each line holds one integer $N$ with $5 \le N \le 10^6$ . The last line holds $0$ , and that line is not a test case.

For each test case, print the largest $M$ on its own line in the form Case #x: M. Here $x$ is the test case number and it starts at 1.

Sifar is said to mean zero in Malay.

Example 1

Input

Expected output

Case #1: 1
Case #2: 2
Case #3: 27