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.io.InputStream;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;

public class Main {
	InputStream in = System.in;
	PrintStream out = System.out;

	// n以下の素数のリスト
	List<Integer> eratosthenes(int n) {
		boolean[] prime = new boolean[n + 1];

		Arrays.fill(prime, true);
		prime[0] = false;
		prime[1] = false;
		for (int i = 2; i * i <= prime.length; i++) {
			if (prime[i]) {
				for (int j = 2; j * i < prime.length; j++) {
					prime[j * i] = false;
				}
			}
		}

		ArrayList<Integer> result = new ArrayList<>();
		for (int i = 0; i < prime.length; i++) {
			if (prime[i]) {
				result.add(i);
			}
		}
		return result;

	}

	public void _main(String[] args) {
		Scanner sc = new Scanner(in);

		int N = sc.nextInt();

		List<Integer> prime = eratosthenes(55556);

		int c = 0;
		List<Integer> ans = new ArrayList<>();
		for (int i = 0; i < prime.size(); i++) {
			int n = prime.get(i);
			if (n % 5 == 1) {
				ans.add(n);
				c++;
			}
			if (c >= N) {
				break;
			}
		}

		for (int x : ans) {
			out.print(x + " ");
		}
		out.println();
		sc.close();

	}

	public static void main(String[] args) {
		new Main()._main(args);
	}

}
