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:
m = int(input())
if m == 0:
    print(1, 2, 3, 4)
else:
    ans = [1]
    i = 10
    while ans[-1] < m:
        cnt = 0
        num = i
        while num % 5 == 0:
            num //= 5
            cnt += 1
        i += 5
        ans.append(cnt + ans[-1])
    if ans[-1] == m:
        print(5)
        ln = len(ans)
        for k in range(ln * 5, (ln * 5) + 5):
            print(k, end=" ")
    else:
        print(0)