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:
import math
m=int(input())
def f(k):
    res=0
    power=5
    l=math.ceil(math.log(k,5))
    for i in range(1,l+2):
        res+=k//power
        power*=5
    return res
def pok(k):
    res=0
    
    while k%5==0:
        res+=1
        k=k//5
    return res
s=4*m+5-((4*m)%5)
t=f(s)
out=0
while t<m:
    s+=5
    
    t+=pok(s)
if t!=m:
    print(0)
else:
    print(5)
    print(" ".join([str(z) for z in [s,s+1,s+2,s+3,s+4]]))