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:
__author__ = 'Azad'

def countZero(n):

    if n ==0:
        return 0
    else:
        return n/5 + countZero(n/5)

low = 1

high = 5*100000

h = high
m = int(raw_input())




while abs(high-low)>5:

    mid = (low+high)/2

    mid_val = countZero(mid)

    if mid_val<=m:
        low = mid
    else:
        high= mid

low = low- 100

if low<0:
    low =0

l =[]
for x in xrange(low,low+h):

    if countZero(x) == m:
        l.append(x)

    if countZero(x)>m:
        break

print len(l)

for x in l:
    print x,