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

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] prime = new int[55556];
		boolean[] isprime = new boolean[55556];
		for (int i = 0; i < isprime.length; i++) {
			isprime[i] = true;
		}
		int p = 0;
		isprime[0] = false; isprime[1] = false;
		for (int i = 2; i < isprime.length; i++) {
			if(isprime[i]) {
				prime[p] = i;
				p++;
				for(int j = 2*i;j < isprime.length; j += i) {
					isprime[j] = false;
				}
			}
		}
		int[] ans = new int[n]; int q = 0;
		for (int i = 0; i < n; i++) {
			while(q<p) {
				if(prime[q]%5==1) {
					ans[i] = prime[q];
					q++;
					break;
				}
				q++;
			}
		}
		for (int i = 0; i < n; i++) System.out.printf("%d ",ans[i]);
		sc.close();
	}
}