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.*;

public class CF633B{ 
  public static int index;
  public static void main(String[] args)throws IOException, Exception {
    InputReader in = new InputReader(System.in);
    PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
    int m = in.nextInt();
    
    int [] a = new int[100005];
    
    int n = 5, c = findTrailingZeros(5);
    while(c <= 100001){
      a[c = findTrailingZeros(n)] = 1;
      n += 5;
    }
    
    if(a[m] == 0) pw.println("0");
    else{
      int count = 0;
      for(int i = 1; i <= m; i++){
        if(a[i] == 0) continue;
        count++;
      }
      count = 5* count;
      pw.println("5");
      for(int i = 0; i < 5 ; i++){
        pw.print(count++ +" ");
      }
      pw.println();
    }
    pw.close();
  }
  
  public static  int findTrailingZeros(int  n)
  {
    int count = 0;
    
    for (int i=5; n/i>=1; i *= 5)
      count += n/i;
    
    return count;
  }
  
  static class InputReader {
    public BufferedReader reader;
    public StringTokenizer tokenizer;
    
    public InputReader(InputStream stream) {
      reader = new BufferedReader(new InputStreamReader(stream));
      tokenizer = null;
    }
    
    public String next() {
      
      try {
        while (tokenizer == null || !tokenizer.hasMoreTokens())
          tokenizer = new StringTokenizer(reader.readLine());
      } catch (IOException e) {
        return null;
      }
      
      return tokenizer.nextToken();
    }
    
    public String nextLine() {
      String line = null;
      try {
        tokenizer = null;
        line =  reader.readLine();
      } catch (IOException e) {
        throw new RuntimeException(e);
      }
      return line;
    }
    
    public int nextInt() {
      return Integer.parseInt(next());
    }
    
    public double nextDouble() {
      return Double.parseDouble(next());
    }
    
    public long nextLong() {
      return Long.parseLong(next());
    }
    public boolean hasNext(){
      try {
        while (tokenizer == null || !tokenizer.hasMoreTokens())
          tokenizer = new StringTokenizer(reader.readLine());
      } 
      catch (Exception e) {
        return false;
      }
      
      return true; 
      
    }
  }
}