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:
import sys
import math
import string
import re	

def find_power(n):
	t =0
	#h = n
	while n>0:
		if n%5==0:
			t += 1
			n /= 5
		else:
			break
	#print "for %d returning %d" %(n,t)
	return t
	
def main():	

	#print find_power(130)
	#sys.exit()
	p = int(raw_input())
	l = 5
	t = 0
	v = 1
	while t<p:
		t += find_power(l)
		l += 5
		v += 1
		
	#print t
	v -= 1
	if t>p:
		print 0
	else:	
		print 5
		for x in range(5*v,5*(v+1)):
			print x,	
	
if __name__ == "__main__":
	main()