Print a sequence a_1, a_2, ..., a_N whose length is N that satisfies the following conditions:

* a_i (1 \leq i \leq N) is a prime number at most 55 555.
* The values of a_1, a_2, ..., a_N are all different.
* In every choice of five different integers from a_1, a_2, ..., a_N, the sum of those integers is a composite number.



If there are multiple such sequences, printing any of them is accepted.

Constraints

* N is an integer between 5 and 55 (inclusive).

Input

Input is given from Standard Input in the following format:


N


Output

Print N numbers a_1, a_2, a_3, ..., a_N in a line, with spaces in between.

Examples

Input

5


Output

3 5 7 11 31


Input

6


Output

2 3 5 7 11 13


Input

8


Output

2 5 7 13 19 37 67 79
import java.util.*;

public class Main {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int N = Integer.parseInt(in.nextLine());
		in.close();
		int MAX = 55555;
		boolean[] isPrime = new boolean[MAX + 1];
		Arrays.fill(isPrime, true);
		isPrime[0] = false;
		isPrime[1] = false;
		primeDetection(isPrime);

		boolean[] valid = new boolean[MAX + 1];

		int count = 0;
		for (int i = 2; i < isPrime.length; ++i) {
			if (isPrime[i] && i % 5 == 1) {
				System.out.print(i + " ");
				count++;
			}
			if (count >= N) {
				break;
			}
		}
		System.out.println("");
	}

	private static void primeDetection(boolean[] isPrime) {
		for (int i = 2; i < isPrime.length; ++i) {
			if (!isPrime[i]) {
				continue;
			}
			for (int j = i * 2; j < isPrime.length; j = j + i) {
				isPrime[j] = false;
			}
		}
	}
}
