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:
m = int (raw_input())
def modfive(n):
	res=0
	while n%5==0:
		res=res+1
		n=n/5
	return res
i=0; s=0;
while 1:
	i=i+5
	s=s+modfive(i)
	if s>m:	
		print 0
		break
	if s==m:
		print 5
		print "%d %d %d %d %d" % (i, i+1, i+2, i+3, i+4) 
		break