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.List;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.io.InputStream;

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

    static class TaskB {
        public void solve(int testNumber, QuickScanner in, PrintWriter out) {
            int max = (int) 1e6 + 1;
            int m = in.nextInt();
            int[] cnt_2 = new int[max];
            int[] cnt_5 = new int[max];
            for (int i = 2; i < max; i++) {
                int x = i;
                while (x % 2 == 0) {
                    cnt_2[i]++;
                    x /= 2;
                }
                while (x % 5 == 0) {
                    cnt_5[i]++;
                    x /= 5;
                }
            }
            cnt_2 = ArrayUtils.partialSums(cnt_2);
            cnt_5 = ArrayUtils.partialSums(cnt_5);
            List<Integer> ans = new ArrayList<>();
            for (int n = 1; ; n++) {
                int current = Math.min(cnt_2[n], cnt_5[n]);
                if (current > m) break;
                if (current < m) continue;
                ans.add(n);
            }
            out.println(ans.size());
            for (int n : ans) out.print(n + " ");
        }

    }

    static class ArrayUtils {
        public static int[] partialSums(int[] a) {
            int[] ret = new int[a.length];
            ret[0] = a[0];
            for (int i = 1; i < a.length; i++) {
                ret[i] = ret[i - 1] + a[i];
            }
            return ret;
        }

    }

    static class QuickScanner {
        BufferedReader br;
        StringTokenizer st;
        InputStream is;

        public QuickScanner(InputStream stream) {
            is = stream;
            br = new BufferedReader(new InputStreamReader(stream), 32768);
        }

        public String nextToken() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(nextToken());
        }

    }
}