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


public class Main {

    public static void main(String[] args) {
        int m = 0;
        Scanner sc=new Scanner(System.in);
        m = Integer.parseInt(sc.nextLine());
        int n = Math.floorDiv(m * 5, 6) + 1;
        int q;
        int counter;
        boolean check = true;
        while (check){
            counter = n;
            q = n;
            while (q > 0){
                counter = counter + Math.floorDiv(q, 5);
                q = Math.floorDiv(q, 5);
            }
            check = false;
            if (counter > m){
                n = n-1;
                check = true;
            }
            else if (counter == m){
                System.out.println(5);
                System.out.print(n*5);
                for (int i = n*5+1; i<n*5+5; i++){
                    System.out.print(" " + i);
                }
            }
            else{
                System.out.print(0);
            }
        }
    }
    
}