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:
def calcZeroes(n):
    d=5
    s=0
    while(n/d>=1):
        s+=n/d
        d*=5
    return s

def bin_srch_fac(mi,ma,n):
    if mi>ma: return -1
    mid = (ma+mi)/2
    s=calcZeroes(mid)
    if n==s: return mid
    elif n<s: return bin_srch_fac(mi,mid-1,n)
    else: return bin_srch_fac(mid+1,ma,n)

MAX=500000

z=input()

f=bin_srch_fac(1,MAX,z)

if f==-1:
    print(0)
else:
    print(5)
    f/=5
    f*=5
    print f,f+1,f+2,f+3,f+4