CF 633B:A Trivial 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.

A=[0,0,0,0,0]
def init():
    for i in range(5,500000):
        x=i
        cnt=0
        while x%5==0:
            x//=5
            cnt+=1
        A.append(cnt)
x=input()
init()
sum=0
num=0
ans=[]
for i in range(1,500000):
    sum+=A[i]
    if sum==x:
        ans.append(i)
        num+=1
    if sum>x:
        break
print num
if num!=0:
   for i in range(len(ans)):
        print '%d ' %(ans[i]),
print ''