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.*;
import java.lang.*;
import java.io.*;
import java.util.ArrayList;
import java.util.Scanner;
 
 
public class Ideone
{
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner sc = new Scanner(System.in);
		int count = 0, b = 5;
    	int c, m;
    	m = sc.nextInt();
     while(count <= m){
       c = b;
        while(c%5 == 0){
          count++;
          c = c / 5;
        }
         if(count == m){
         	System.out.println("5");
            for(int i = 0; i < 5; i++){
            	System.out.print(b + i);
            	System.out.print(" ");
            }
        	 System.exit(0);
         }
          b = b + 5;
     }
    System.out.print("0");
	}
}