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:
import time
import math
n = int(input())
start = time.time()
i = 0
results = []

c = [(5 ** i) for i in range(1, 9)]
def powers(n):
    #print(c)
    res = 0
    for i in range(len(c)):
        res +=  math.floor(n / c[i])
    return res

while True:
    i += 1
    k = powers(i)
   # print(i, k)
    if k == n:
        #print('powers:', powers(i))
        results.append(i)        
    if k > n:
        break
end = time.time()
print(len(results))
if len(results) != 0:
    print(' '.join(list(map(str, results))))
#print(end - start)