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 PYTHON):

Solution:

def count(n,r):
    ret = 0
    while True:
        if n%r==0:
            n=n/r
            ret+=1
        else:
            break
    return ret


m = int(raw_input())

i=1
c2 = 0
c5 = 0
answer = []
while True:
    c2 += count(i,2)
    c5 += count(i,5)
    if min(c2,c5) == m:
        answer.append(i)
    elif min(c2,c5) > m:
        break
    i += 1

if len(answer) > 0:
    print len(answer)
    print ' '.join(map(str, answer))
else:
    print 0