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:
#!/usr/bin/python2.7
def func(num):
	ret=0
	while num>=5:
		ret += num/5
		num /= 5
	return ret
n=input()
lo,hi=1,1000000000
while lo + 1 < hi:
	mid = (lo + hi) / 2
	vmid = func(mid)
	if vmid > n: hi = mid - 1
	else: lo = mid
if n != func(lo):
	print 0
else:
	v = lo / 5 * 5
	print 5
	print v,v+1,v+2,v+3,v+4