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:
m=int(input())
lo=1 
hi=10**18 
ans=-1
def num_zero(n):
    cnt=0 
    while n//5:
        cnt+=n//5 
        n=n//5 
    return cnt
while lo<=hi:
    mid=(lo+hi)//2 
    if num_zero(mid)==m:
        ans=mid
        hi=mid-1
    elif num_zero(mid)>m:
        hi=mid-1
    else:
        lo=mid+1
if m==0:
    print(4)
    print('1 2 3 4')
elif ans==-1:
    print(0)
else:
    res=[]
    curr=ans 
    while num_zero(curr)==m:
        res.append(curr)
        curr+=1 
    print(len(res))
    print(*res)