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 PYTHON):

Solution:
m = int(raw_input())


def num_zeroes(n):
    z = 0
    d = 5
    while n >= d:
        z += n / d
        d *= 5
    return z


def get_elem(i):
    return 5 * i


def inv_bin(get_elem, get_val, start, end, target):
    while start <= end:
        mid = (start + end) / 2
        elem_mid = get_elem(mid)
        val_mid = get_val(elem_mid)
        if val_mid == target:
            return elem_mid, mid
        if val_mid > target:
            end = mid - 1
        else:
            start = mid + 1
    return -1, -1

result, _ = inv_bin(get_elem, num_zeroes, 0, m, m)
if result == -1:
    print 0
else:
    print 5
    print " ".join(map(str, range(result, result + 5)))