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 static java.lang.Integer.parseInt;

public class A_Trivial_Problem {
    public static void main(String[] args) throws IOException {
        BufferedReader read = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter prnt = new PrintWriter(System.out);

        int m = parseInt(read.readLine());
        int coEfficient = 1;
        int count = 0;

        while (true) {
            int y = coEfficient * 5;
            while (y % 5 == 0) {
                y = y / 5;
                count++;
            }
            if (count == m) {
                prnt.println(5);
                int j = 0;
                while (j < 5) {
                    prnt.print(coEfficient * 5 + j + " ");
                    j++;
                }
                break;
            } else if (count > m) {
                prnt.println(0);
                break;
            }
            coEfficient++;
        }
        prnt.close();
    }
}