A Factorial Problem

View as PDF

Submit solution

Points: 10
Time limit: 0.2s
Java 0.6s
Python 1.0s
Memory limit: 64M

Problem type

You task is to find minimal natural number \(N\), so that \(N!\) contains exactly \(Q\) zeroes on the trail in decimal notation. As you know \(N! = 1 \times 2 \times \ldots \times N\). For example, \(5! = 120\), \(120\) contains one zero on the trail.

Input Specification

The first line will contain the integer \(Q\ (0 \le Q \le 10^8)\).

Output Specification

Print No solution, if there is no such number \(N\), and \(N\) otherwise.

Sample Input


Sample Output



There are no comments at the moment.