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:
def count(x, y):
    res = 0
    while x % y == 0:
        res += 1
        x /= y
    return res

N = 4 * 10 ** 5 + 100
cnt2 = [0] * N
cnt5 = [0] * N
for i in range(1, N):
    cnt2[i] = cnt2[i - 1] + count(i, 2)
    cnt5[i] = cnt5[i - 1] + count(i, 5)

m = int(input())
ans = []
for i in range(1, N):
    if min(cnt2[i], cnt5[i]) == m:
        ans += [i]
print(len(ans))
for i in ans:
    print(i, end = ' ')