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 solve(n):
	z = 0
	while n > 0:
		#print n, z
		n /= 5
		z += n
	return z

# print solve(99)
n = input()

l= 0 
r = 1000000000
# print solve(5800)
while l < r:
	mid = (l+r)/2
	#print mid, l, r
	if solve(mid) < n:
		l = mid + 1
	else:
		r = mid

cnt = 0
ans = []
# print 'l is {0}, n is {1}'.format(l, n)
while solve(l) == n:
	cnt += 1
	ans.append(l)
	l += 1

print cnt
if cnt > 0:
	print " ".join(map(str, ans))