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 PYTHON):

Solution:
m = int(raw_input())
lo = 0
hi = 100010
while lo + 1 < hi:
    mid = x = (lo + hi) / 2
    k = 0
    while x:
        k += x
        x /= 5
    if k >= m:
        hi = mid
    else:
        lo = mid
k = 0
x = hi
while x:
    k += x
    x /= 5
if k == m:
    print 5
    for x in range(5):
        print x + hi * 5,
else:
    print 0