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())
l,q,k,r,i=[1]*m,0,5,m,0
while m>=5:
    q+=1
    m//=5
    k*=5
while q!=i:
    i+=1
    for j in range(5**i-1,r,5**i):l[j]+=1
for i in range(1,r):l[i]+=l[i-1]
if r in l:
    q=5*(l.index(r)+1)
    print(5,"\n",q,q+1,q+2,q+3,q+4)
else:print(0)