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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.ArrayList;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        BATrivialProblem solver = new BATrivialProblem();
        solver.solve(1, in, out);
        out.close();
    }

    static class BATrivialProblem {
        public void solve(int testNumber, Scanner in, PrintWriter out) {

            int n = in.nextInt();

            int fact = 1;
            int i = 1;
            int zCount = 0;
            int result = 0;

            ArrayList<Integer> list = new ArrayList<Integer>();
            boolean flag = false;


            zCount = 0;
            while (true) {
                int val = i;
                for (; val % 5 == 0; val = val / 5) {
                    zCount++;
                }
                if (zCount == n) {
                    list.add(i);
                    result++;
                }
                if (zCount > n) {
                    break;
                }
                i++;
            }

            out.println(result);
            for (Integer val : list) {
                out.print(val + " ");
            }

        }

    }
}