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

public class Cc {

	public static void main(String[] args) {
		Scanner clavier=new Scanner(System.in);
		int m=clavier.nextInt();
		long[] tab = new long[1000000];
		int g=0;
		int y=0;
		for(int k=0;k<1000000;k++)
		{tab[k]=0;}
		for(int i=1;i<=1000000;i++)
			
			{if((i/5)<=m) 
				{y=0;
				int t=i;
				while(t!=0)
					{t=t/5;
					
					
				y=y+t;}
			if(y==m)
				{
				tab[i]=i;
				g++;
				}}}
		System.out.println(g);
		for(int o=0;o<tab.length;o++)
		{if(tab[o]!=0)
			System.out.print(tab[o]+" ");}
		
		
        	
				
	}
}