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 main():
    n = int(input()) + 1
    if n == 1:
        print("4\n1 2 3 4")
        return
    p, l = 5, [1] * n
    while p < n:
        for i in range(p, n, p):
            l[i] += 1
        p *= 5
    p = 0
    for i, a in enumerate(l):
        p += a
        if p == n:
            print(5)
            print(*range(i * 5, i * 5 + 5))
            return
    print(0)


if __name__ == '__main__':
    main()