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 JAVA):

Solution:
import java.util.*;
public class trivia
{
    public static void main(String ar[])
    {
        Scanner sc=new Scanner(System.in);
        long m=sc.nextLong();
        int a=0,i=0,j,s=0,flag=0;
        while(s<m)
        {
            i+=5;j=i;a=0;
            while(j%5==0)
            {
                a++;
                j/=5;
            }
            if(a>1)
            for(int k=s+1;k<s+a;k++)
            if(k==m)
            flag=1;
            s=s+a;
        }
        if(flag==1)
        System.out.println(0);
        else
        System.out.println(5+"\n"+i+" "+(i+1)+" "+(i+2)+" "+(i+3)+" "+(i+4));        
    }
}