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:
m=int(input())
if(m==0):
    print(0);
    print(0,1,2,3,4,end=" ");
else:
    t=0;
    i=4;
    while(t<m):
        p=5;
        t=0;
        i=i+1;
        while(p<=i):
            t=t+int(i/p);
            p=p*5;
    l=[];
    a=0;
    while(t==m):
        a=a+1;
        l=l+[i];
        i=i+1;
        t=0;
        p=5;
        while(p<=i):
            t=t+int(i/p);
            p=p*5;
    print(a);
    for k in l:
        print(k,end=" ");