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 powe(i):
	j = i
	c = 0
	while j>1:
		c += 1
		j = j/5
	return c
n = int(raw_input())
lis = [5,25,125,625,3125,15625,78125,390625,1953125]
ans = [0]*500001
for i in lis:
	j = 1
	while j*i <=500000:
		ans[j*i] +=	1
		j += 1
for i in range(1,len(ans)):
	ans[i] += ans[i-1]
# print ans[:100]
a = []
count = 0
for i in range(0,len(ans)):
	if ans[i]==n:
		count += 1
		a.append(i)
print count
s=""
if count :
	for i in a:
		s+=str(i)+" "
	print s