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.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Iterator;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class Manthan {

    public void solve() throws IOException {
        StringTokenizer st = new StringTokenizer(bf.readLine());
        long n = Long.parseLong(st.nextToken());
        TreeSet<Long> set = new TreeSet<>();
        for (long i = 1;; i++) {
            long c = count(i);
            if (c > n) {
                break;
            }
            if (c == n) {
                set.add(i);
            }
        }
        System.out.println(set.size());
        if (set.size() != 0) {
            Iterator<Long> it = set.iterator();
            while (it.hasNext()) {
                System.out.print(it.next());
                System.out.print(" ");
            }
            System.out.println();
        }
    }

    public long count(long n) {
        long i = 1, count = 0;
        while (pow(5, i) <= n) {
            count += n / pow(5, i);
            i++;
        }
        return count;
    }

    public long pow(long x, long n) {
        if (n == 0) {
            return 1;
        }
        if (n % 2 == 0) {
            return pow(x * x, n / 2);
        }
        return x * pow(x * x, n / 2);
    }

    public Manthan() {
        bf = new BufferedReader(new InputStreamReader(in));
        pw = new PrintWriter(out);
    }

    public static void main(String[] args) throws IOException {
        Manthan main = new Manthan();
        main.run();
    }

    public void run() throws IOException {
        solve();
        pw.flush();
        bf.close();
        pw.close();
    }

    public final BufferedReader bf;
    public final PrintWriter pw;
    public final InputStream in = System.in;
    public final OutputStream out = System.out;
}