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:
/**
 *@author nitin.yadav
 */

//package code.forces.manthan;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;

public class Solution {

    public static int min(int a, int b) {
        return a > b ? b : a;
    }

    public static void main(String[] args) throws IOException {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        String temp = in.readLine();
        StringBuilder sb = new StringBuilder();
        int a = Integer.parseInt(temp);
        int countZero = 0;
        int num = 1;
        while (countZero < a) {
            int count = 0;
            for (int i = 5; num / i >= 1; i *= 5)
                count += num / i;
            countZero = count;
            num++;
        }
        List<Integer> ints = new ArrayList<Integer>();
        if (countZero > a)
            System.out.println("0");
        else {
            num = num - 1;
            while (countZero == a) {
                int count = 0;
                for (int i = 5; num / i >= 1; i *= 5)
                    count += num / i;
                countZero = count;
                if (countZero == a)
                    ints.add(num);
                num++;
            }
        }
        if (ints.size() > 0)
            System.out.print(ints.size() + "\n");
        for (Integer i : ints) {
            System.out.print(i + "\t");
        }
        System.out.print("\n");
        // int b = Integer.parseInt(temp[1]);
        // int c = Integer.parseInt(temp[2]);
        // int min = min(a, b);
        // int sum = c;
        // if (checkShield(sum, a, b, min))
        // System.out.println("Yes");
        // else
        // System.out.println("No");
    }
}