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 zero(n):
    u = 0
    v = 5
    while n // v > 0:
        u += n // v
        v *= 5
    return u
m = int(input())
l, r, val = 0, m, 0
while l <= r:
    mid = (l+r) >> 1
    u = zero(mid * 5)
    if u == m:
        val = mid * 5
        break
    else:
        if u > m:
            r = mid - 1
        else:
            l = mid + 1
if val > 0:
    print(5)
print(val, end = ' ')
if val > 0:
    print(val + 1, val + 2, val + 3, val + 4)