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:
# You lost the game.
m = int(input())
r = 0
l = 1
n = 0
k = 0
L = []
while n <= m:
    #print("<>")
    k += 1
    l *= k
    #print(l,n,k)
    while l % 10 == 0:
        n += 1
        l = l // 10
    #print(l,n)
    #l = l % 10
    l = int(str(l)[len(str(l))//3:])
    if n == m:
        r += 1
        L += [k]
if r == 0 or r == 5:
    print(r)
    for i in range(r):
        print(L[i],end=" ")
else:
    print(0)