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.HashMap;
import java.util.Scanner;

public class Main
{
	static Scanner in = new Scanner(System.in);

	public static void main(String[] args)
	{
		int m = in.nextInt();
		int st = 5;
		int cnt = 0;
		HashMap<Integer, Integer> map = new HashMap<>();
		while (cnt <= m)
		{
			int tmp = 0;
			int num = st;
			while (num % 5 == 0)
			{
				num /= 5;
				tmp++;
			}
			cnt += tmp;
			map.put(cnt, st);
			
			st += 5;
			
		}
		if(map.containsKey(m))
		{
			System.out.println(5);
			for(int i=0;i<4;i++)
				System.out.print(map.get(m)+i+" ");
			System.out.println(map.get(m)+4);
		}
		else 
		{
			System.out.println(0);
		}
		//System.out.println(map);
	}

}