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.*;
import java.io.*;
import java.math.*;
import java.lang.Math.*;

public class Main 
{
    public static void main (String[] args) throws Exception
    {
        
        Scanner sc=new Scanner(System.in);
        long m=sc.nextLong();
        long x=5;
        long s=0;
        long w=0;
        long y=0;
        while(s<m)
        {
            long r;
            for(long t=1;t<=100000;t++)
            {
              r=x*t;
              while(r%5==0)
              {
                  s++;
                  r=r/5;
              }
              if(s>m)
              {
                  w=1;
                  break;
              }
              else if(s==m)
              {
                  w=0;
                   y=t;
                  break;
              }
             
            }
        }
        long q=5*y;
        if(w==0)
        {
        System.out.println("5");
        for(int i=0;i<5;i++)
        {
            System.out.print(q+" ");
            q++;
        }
        }
        else
        {
            System.out.println("0");
        }
    }
}