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 static java.lang.System.in;

import java.io.IOException;

public class BManthan {

	public static byte[] buffer = new byte[8192];
	static int offset = 0;
	static int bufferSize = 0;

	public static void main(String[] args) throws IOException {
		int m = readInt();
		long arr[] = new long[m + 1];
		int idx = -1;
		long sum = 0;
		for (int i = 1; i <= m; i++) {
			if (i % 5 == 0) {
				arr[i] = 1 + arr[i / 5];
			} else {
				arr[i] = 1;
			}
		}

		for (int i = 1; i <= m; i++) {
			sum = sum + arr[i];
			if (sum == m) {
				idx = i;
				break;
			}
			if (sum > m)
				break;
		}

		if (idx == -1) {
			System.out.println(0);
			return;
		} else {
			System.out.println(5);
			for (int j = 5 * idx; j < 5 * (idx + 1); j++)
				System.out.print(j + " ");
		}
	}

	static int readInt() throws IOException {
		int number = 0;
		int s = 1;
		if (offset == bufferSize) {
			offset = 0;
			bufferSize = in.read(buffer);
		}
		for (; buffer[offset] < 0x30 || buffer[offset] == '-'; ++offset) {
			if (buffer[offset] == '-')
				s = -1;
			if (offset == bufferSize - 1) {
				offset = -1;
				bufferSize = in.read(buffer);
			}
		}
		for (; offset < bufferSize && buffer[offset] > 0x2f; ++offset) {
			number = number * 0x0a + buffer[offset] - 0x30;
			if (offset == bufferSize - 1) {
				offset = -1;
				bufferSize = in.read(buffer);
			}
		}
		++offset;
		return number * s;
	}

}