Problem: Mr. Santa asks all the great programmers of the world to solve a trivial problem. He gives them an integer m and asks for the number of positive integers n, such that the factorial of n ends with exactly m zeroes. Are you among those great programmers who can solve this problem?

Input

The only line of input contains an integer m (1 ≤ m ≤ 100 000) — the required number of trailing zeroes in factorial.

Output

First print k — the number of values of n such that the factorial of n ends with m zeroes. Then print these k integers in increasing order.

Examples

Input

1


Output

5
5 6 7 8 9 

Input

5


Output

0

Note

The factorial of n is equal to the product of all integers from 1 to n inclusive, that is n! = 1·2·3·...·n.

In the first sample, 5! = 120, 6! = 720, 7! = 5040, 8! = 40320 and 9! = 362880.

Solution (in PYTHON3):

Solution:
m = int(input())
k = 5 * m
while k >= 4 * m:
    s, i = k // 5, 2
    p = k // pow(5, i)
    while p:
        s, i = s + p, i + 1
        p = k // pow(5, i)
    if s == m:
        break
    k -= 5
if k < 4 * m:
    print(0)
else:
    print(5)
    print(k, k + 1, k + 2, k + 3, k + 4)