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 findTrailingZeros(n): 
	
	# Initialize result 
	count = 0

	# Keep dividing n by 
	# powers of 5 and 
	# update Count 
	i=5
	while (n/i>=1): 
		count += int(n/i) 
		i *= 5

	return int(count) 

m = int(input())
n = 0
ans = 0
flag = 0
while (True):
    if ans == m:
        flag = 1
        break
    elif ans>m:
        flag = -1
        break
    else:
        n += 5
        ans = findTrailingZeros(n)
        
if flag == 1:
    print(5)
    print(*list(range(n,n+5)))
else:
    print(0)