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:
def s(n):
    ans = 0
    while n:
        t = n//5
        ans += t
        n = t
    return ans

n = int(input())

l = 0
r = 1000000

while r-l > 1:
    m = (l+r)//2
    res = s(m)
    if res >= n:
        r = m
    elif res < n:
        l = m

ans = []

while s(r) == n:
    ans.append(r)
    r += 1

print(len(ans))

if ans:
    print(" ".join(map(str, ans)))
    
"""
if not(n%5):
    print(0)
else:
    print(5)
    n -= n//5
    for i in range(n*5, n*5+5):
        print(i, end = " ")
"""