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:
def main():
	n = int(input())
	first = solver(n)
	if first == None:
		print(0)
	else:
		print(5)
		for x in range(first, first + 5):
			print(x)

def solver(n):
	multiplier = 1
	while trailingZeros(multiplier) <= n:
		multiplier *= 5
	# do binary search
	lo = multiplier // 5
	hi = multiplier
	while lo < hi:
		mid = (lo + hi) // 2
		#print(mid)
		zeros = trailingZeros(mid)
		if zeros < n:
			lo = mid + 1
		elif zeros >= n :
			hi = mid
	if trailingZeros(lo) != n:
		return None
	else:
		return lo

def trailingZeros(n):
	count = 0
	fives = 5
	while fives <= n:
		count += n // fives
		fives *= 5
	return count

main()

#print(solver(11))