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.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Trivial {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int in = sc.nextInt();
        List<Integer> nums = new ArrayList<>();
        int res = solve(in, nums);
        if (res == 0) {
            System.out.println(res);
        } else {
            System.out.println(res);
            for (Integer num : nums) {
                System.out.print(num + " ");
            }
        }
    }

    public static int solve(int m, List<Integer> res) {
        List<Integer> nums = new ArrayList<>();

        int zeros = 0;
        int i = 1;
        while (true) {

            if (i % 50 == 0) {
                int t = i;
                while (t >=50 && t % 50 == 0) {
                    t /= 50;
                    zeros += 2;
                }
                while (t >= 5 && t % 5 == 0) {
                    t = t / 5;
                    zeros++;
                }
            } else if (i % 10 == 0) {
                int t = i;
                while (t >= 10 && t % 10 == 0) {
                    t = t / 10;
                    zeros++;
                }
            } else if (i % 5 == 0) {
                int t = i;
                while (t >= 5 && t % 5 == 0) {
                    t = t / 5;
                    zeros++;
                }
            }

            nums.add(i);
            if (zeros == m) {
                break;
            }
            if (zeros > m) {
                return 0;
            }
            i++;

        }

        int start = nums.get(nums.size() - 1);
        res.add(start);
        for (int p=start+1; p % 5 != 0 && p %10 !=0; p++) {
            res.add(p);
        }

        return res.size();
    }
}