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:


"""
[int(i) for i in raw_input().split(" ")]
raw_input()
raw_input().split(" ")


"""

def main():
	a = int(raw_input())
	
	c2 = 0
	c5 = 0
	c = 1
	L = []
	while True:
		c += 1
		
		c2t = c
		c5t = c
		while c2t % 2 == 0:
			c2t /= 2
			c2 += 1
		while c5t % 5 == 0:
			c5t /= 5
			c5 += 1
		
		if min(c2,c5) == a:
			L.append(c)
	
		if min(c2,c5) > a:
			break
	
	if len(L) == 0:
		print 0
		return
	
	print len(L)
	
	for i in L:
		print i,
	print
	
	
	
	
	
	
	
	
	
main()