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:
n = int(input())

def zrs(n):
    ret = 0
    while n >= 5:
        n //= 5
        ret += n
    return ret

def bins(n):
    a,b = 1, n * 5 +1
    while a < b:
        mid = (a+b) // 2
        guess = zrs(mid)
        #print (guess)
        #print(a,b)
        if guess < n:
            a = mid +1
        elif guess > n:
            b = mid -1
        else:
            return mid
    return 0

x = bins(n)
x = x - x%5

if x == 0:
    print('0')
else:
    print('5')
    print(' '.join(map(str,range(x, x+5))))