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:
from math import *
n = int(input())
per = 0
per2 = 5
cou = 0
cou2 =1
while per < n:
    cou2+=1
    while per2 % 5 == 0:
        per2 = per2//5
        per+=1
    if per == n:
        cou = 1
        per2 = (cou2-1) * 5
        break
    
    per2 = cou2 * 5
if cou == 1:
    print(5)
    print(per2, per2+1,per2+2,per2+3,per2+4)
else:
    print(0)