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:
/**
 * Created by Anna on 13.03.2016.
 */

import com.sun.corba.se.pept.transport.InboundConnectionCache;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.StringTokenizer;

public class TaskB {
    StringTokenizer st;
    PrintWriter out;
    BufferedReader in;

    public static void main(String[] args) throws IOException {
        TaskB solver = new TaskB();
        solver.open();
        solver.solve();
        solver.close();

    }


    private void solve() throws IOException {
        int m = nextInt();
        int cntTwo = 0;
        int cntFive = 0;

        int answ = 0;
        ArrayList<Integer> answInts = new ArrayList<>();

        for (int i = 2; i < 1000000; i++) {
            int tmp = i;

            while (tmp % 2 == 0) {
                cntTwo++;
                tmp /= 2;
            }

            while (tmp % 5 == 0) {
                cntFive++;
                tmp /= 5;
            }

            if (cntTwo > m && cntFive > m) break;
            if (m <= cntTwo && m <= cntFive) {
                answ++;
                answInts.add(i);
            }
        }

        out.println(answ);
        for (Integer answInt : answInts) {
            out.print(answInt+ " ");
        }
    }

    private String nextToken() throws IOException {
        while (st == null || !st.hasMoreTokens()) {
            String str = in.readLine();
            if (str == null) return null;
            st = new StringTokenizer(str);
        }
        return st.nextToken();
    }

    private int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }


    private double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }


    private long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }

    private void close() {
        out.close();
    }

    private void open() {
        in = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
    }
}