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())
p  = []
i = 0
c = 5
while c <= 1000000:
    p.append(c)
    i+=1
    c*=5
start = False
ans = []
zeros = 0
vec = []
for i in range(1, 1000000 + 1):
    for o in range(0, len(p)):
        if i % p[o] == 0:
            zeros += 1
    if zeros == m:
        start = True
    if zeros > m:
       break
    if start:
      ans.append(i)
print(len(ans))
for  a in ans:
    print(a,end = ' ')