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:
n = int(input())
ans = 0
i = 1
while i < 1000000:
    if i % 5 == 0:
        ans+=1
    if i % 25 == 0:
        ans+=1
    if i % 125 == 0:
        ans +=1
    if i % 625 == 0:
        ans +=1
    if i % 3125 == 0:
        ans +=1
    if i % 5 ** 6 == 0:
        ans +=1
    if i % 5 ** 7 == 0:
        ans += 1
    if i % 5 ** 8 == 0:
        ans += 1
    if i % 5 ** 9 == 0:
        ans += 1
    if i % 5 ** 10 == 0:
        ans += 1
    if ans == n:
        break
    i += 1
if ans == n:
    print(5)
    print(i,i + 1,i + 2,i + 3,i + 4)
else:
    print(0)