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 cnt_zeroes(n):
    p5 = 1
    i = 0
    while 5 * p5 <= n:
        p5 *= 5
        i += 1
    ans = 0
    all_cnt = 0
    while p5 > 1:
        ans += i * (n // p5 - all_cnt)
        all_cnt += (n // p5 - all_cnt)
        p5 //= 5
        i -= 1
    return ans

def bin_search(n):
    l = 1
    r = 1000000
    while r - l > 1:
        m = (l + r) // 2
        if cnt_zeroes(m) < n:
            l = m + 1
        else:
            r = m
    if cnt_zeroes(l) == n:
        return l
    else:
        return r

n = int(input())
f = bin_search(n)
if cnt_zeroes(f) == n:
    print(5)
    for x in range(f, f + 5):
        print(x,end=' ')
    print()
else:
    print(0)