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

public class B {
    FastScanner in;
    PrintWriter out;

    int get2(int n) {
        int ans = 0;
        while (n % 2 == 0) {
            ans++;
            n /= 2;
        }
        return ans;

    }

    int get5(int n) {
        int ans = 0;
        while (n % 5 == 0) {
            ans++;
            n /= 5;
        }
        return ans;

    }

    public void solve() throws IOException {
        int n = in.nextInt();
        int[] c2 = new int[1000000 + 100];
        int[] c5 = new int[1000000 + 100];
        for (int i = 1; i < c2.length; i++) {
            c2[i] = c2[i - 1] + get2(i);
            c5[i] = c5[i - 1] + get5(i);
        }
        //out.println(Arrays.toString(c2));
        //out.println(Arrays.toString(c5));
        List<Integer> ans = new ArrayList<>();
        for (int i = 0; i < c2.length; i++) {
            if (Math.min(c2[i], c5[i]) == n) {
                ans.add(i);
            }
        }
        out.println(ans.size());
        ans.stream().forEach(i -> out.print(i + " "));
        out.println();
    }

    public void run() {
        try {
            in = new FastScanner(System.in);
            out = new PrintWriter(System.out);
            Locale.setDefault(Locale.US);

            solve();

            out.close();
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        FastScanner(InputStream f) {
            br = new BufferedReader(new InputStreamReader(f));
        }

        String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

    public static void main(String[] arg) {
        new B().run();
    }
}