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.*;
import java.util.StringTokenizer;

public class B633 {
  static class Solver {
    void solve() throws Exception {
      int m = nextInt();
      int count = 0;
      int n = 0;
      while (count < m) {
        n += 5;
        int _n = n;
        while (_n % 5 == 0) {
          count++;
          _n /= 5;
        }
      }
      if (count == m) {
        writer.println(5);
        for (int i = 0; i < 5; i++) {
          writer.print(n + i + " ");
        }
      } else {
        writer.println(0);
      }
    }
  }

  // -------------------------------------

  static BufferedReader reader;
  static StringTokenizer tokenizer;
  static PrintWriter writer;

  static String next() throws Exception {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      tokenizer = new StringTokenizer(reader.readLine());
    }
    return tokenizer.nextToken();
  }

  static int nextInt() throws Exception {
    return Integer.parseInt(next());
  }

  public static void main(String[] args) throws Exception {
    reader = new BufferedReader(new InputStreamReader(System.in));
    writer = new PrintWriter(System.out);
    Solver solver = new Solver();
    solver.solve();
    reader.close();
    writer.close();
  }
}