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:
from math import *
m=int(input())

def facteur(n):
    
    nb2=0
    nb5=0
    while 1:
        if n%2==0:
            nb2+=1
            n=n//2
        elif n%5==0:
            nb5+=1
            n=n//5
        else:
            break
    return (nb2,nb5)

i=1
n2=0
n5=0
n10=0
L=[]
s=0
while 1:
    p=facteur(i)
    n2=n2+p[0]
    n5=n5+p[1]
    while n2>0 and n5>0:
        n10=n10+1
        n2-=1
        n5-=1
    if n10==m:
        L.append(i)
        s=5
    elif n10>m:
        break
    i=i+1
print(s)
for x in L:
    print(x,end=' ')