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;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author lebegio
 */
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);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskB {
        public int getDeg(int x) {
            int k = 0;
            while (x % 5 == 0) {
                x /= 5;
                k++;
            }
            return k;
        }

        public void solve(int testNumber, Scanner st, PrintWriter out) {
//        this.st = st;
            int m = st.nextInt();
            int M = m * 10;
            long k = 0;
            for (int i = 5; i <= M; i += 5) {
                k += getDeg(i);
                if (k > m) {
                    out.println(0);
                    return;
                } else if (k == m) {
                    out.println(5);
                    out.println(i + " " + (i + 1) + " " + (i + 2) + " " + (i + 3) + " " + (i + 4));
                    break;
                }
            }

        }

    }
}