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

public class ATrivialProblem {
public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader inp = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Solver solver = new Solver();
        solver.solve(inp, out);
        out.close();
        }

static class Solver {
    private static int MAXN = 1000001;
    private void solve(InputReader inp, PrintWriter out) {
        int[] inc = new int[MAXN];

        //10k
        for (int i = 10; i < MAXN; i += 10) {
            int zero = 0;
            int num = i;
            while (num % 10 == 0) {
                zero++;
                num /= 10;
            }
            while (num % 5 == 0) {
                zero++;
                num /= 5;
            }
            if (num % 5 == 0) zero++;
            inc[i] += zero;
        }

        for (int i = 5; i < MAXN; i += 10) {
            int zero = 0;
            int num = i * 2;
            while (num % 10 == 0) {
                zero++;
                num /= 10;
            }
            while (num % 5 == 0) {
                zero++;
                num /= 5;
            }
            inc[i] += zero;
        }

        int m = inp.nextInt();
        int zeros = 0;
        LinkedList<Integer> res = new LinkedList<>();
        for (int i = 1; i < MAXN; i++) {
            zeros += inc[i];
            if (zeros == m) res.addLast(i);
        }

        out.println(res.size());
        for (Integer i: res) out.print(i + " ");
    }
}

static class InputReader {
    BufferedReader reader;
    StringTokenizer tokenizer;

    InputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream), 32768);
        tokenizer = null;
    }

    String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }
    public long nextLong() {
        return Long.parseLong(next());
    }
}
}