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 Factorial {
    
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int m = in.nextInt();
        int n = f5(m);
        int ans = 0;
        boolean ansb = true;
        while (n >= 0) {
            int k = coeff(n);
            int p = p5(n+1);
            int i = 0;
            while (i < 4 & m >= k) {
                m -= k;
                ans += p;
                i++;
            }
            n--;
        }
        if (m != 0) {
            System.out.println(0);
        }
        else {
            System.out.println(5);
            for (int j = 0; j < 4; j++) {
                System.out.print((ans+j) + " ");
            }
            System.out.println(ans+4);
        }
    }
    
    public static int f5(int a) {
        int i = 1;
        while (coeff(i) <= a) {
            i++;
        }
        return i-1;
    }
    
    public static int coeff(int a) {
        if (a == 0) {
            return 1;
        }
        else {
            return coeff(a-1)*5 + 1;
        }
    }
    
    public static int p5(int a) {
        if (a == 0) {
            return 1;
        }
        else {
            return 5 * p5(a-1);
        }
    }
    
}