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:
a=int(input())
t=[]
num=1
two=0
five=0
counter=0
k=0
while k<=a :
    if k==a :
        counter=counter+1
        t.append(num-1)
    s=num
    while s%2==0 :
        two+=1
        s=s/2
    
    while s%5==0 :
        five+=1
        s=s/5
    while two>0 and five>0 :
        k=k+1
        two=two-1
        five=five-1
    num=num+1
print(counter)
for i in t :
    print(i,end=' ')