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:
__author__ = 'Utena'
def t(x):
    c=0
    if x%5==0:return t(x//5)+1
    else:return 0
m=int(input())
i=5
n=0
c=[]
t1=0
while True:
    n+=t(i)
    if n==m:
        t1+=1
        c.append(str(i))
    if n>m:break
    i+=1
if t1==0:
    print(0)
else:
    print(t1)
    print(' '.join(c))