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.io.InputStreamReader;
import java.io.BufferedReader;
import java.util.StringTokenizer;
import java.util.HashMap;
import java.math.BigInteger;
import java.util.Scanner;
import java.util.ArrayList;
import java.io.PrintWriter;
public class JavaApplication78 {

    public static void main(String[] args) throws Exception{
     BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
     // PrintWriter pr= new PrintWriter(System.out);
       StringTokenizer tok = new StringTokenizer(in.readLine());
       StringBuilder str = new StringBuilder();
      int m=nextInt(tok);
       
long i=5;long j = 0;long e=25;long c=0;
o:
while(true){ 
        

    j=i/5;

 
   for(int  g= 2 ;;g++){
      if(i/e==0)
          break;
        
           j+=i/e; e*=5;
           if(j>m){
               j=0;
               break o;}
       }
      
            
       if(j==m)   
       {c++;
        str.append(i+" ");
       }
      
       e=25;
j=0;
     i++;} 
    

    
   

System.out.println(c);
System.out.println(str);
 
                
       } 
    static double nextDouble(StringTokenizer tok){
    return Double.parseDouble(tok.nextToken());
}
public static int nextInt(StringTokenizer tok) {
        return Integer.parseInt(tok.nextToken());
    }
    }