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.Scanner;

/**
 * Created by Alvin on 4/11/2016.
 */
public class Codefocres_Codefest_16_ATrivialProblem {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int requirement = input.nextInt();
        ArrayList<Long> solution = new ArrayList<>();
        for (long i = 1; i <= Integer.MAX_VALUE; i++) {
            if(trailingZero(i) == requirement) {
                solution.add(i);
            } else if(trailingZero(i) > requirement) {
                break;
            }
        }
        System.out.println(solution.size());
        for(long x: solution) {
            System.out.print(x + " ");
        }
    }

    public static long trailingZero(long x) {
        long total = 0;
        long multiple = 5;
        while(x / multiple != 0) {
            total += (x / multiple);
            multiple *= 5;
        }
        return total;
    }
}