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:
from time import time


def timeit(f):
    def wrapped(*args, **kwargs):
        start = time()
        result = f(*args, **kwargs)
        print '{0} s'.format(time() - start)
        return result
    return wrapped


def find_zeros(x):
    rez = 0
    add = x / 5
    while add:
        rez += add
        add /= 5
    return rez


def solve():
    m = int(raw_input())
    n = 5
    zeros = 1
    while zeros < m:
        n += 5
        zeros = find_zeros(n)
    if zeros == m:
        print 5
        print n, n + 1, n + 2, n + 3, n + 4
    else:
        print 0


solve()