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:
import os
import math
import time
s5 = []
s2 = []
res = []
a = int(input())
for i in range(500):
    s5.append(5**i)
    s2.append(2**i)
ar = [0]*1000010
for i in range(1,1000000):
    a3 = 0
    a2 = 0
    for j in range(1,500):
        if i//s5[j]>0:
            a3+=i//s5[j]
        else:
            break
    for j in range(1,500):
        if i //s2[j]>0:
            a2+=i//s2[j]
        else:
            break
    ar[i]=min(a2,a3)
    if ar[i]>a:
        break
    if ar[i]== a:
        res.append(i)
print(len(res))
for i in res:
    print(i, end=' ')