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

public class Main{
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int N = scan.nextInt();
		scan.close();
		ArrayList<Integer> list = new ArrayList<Integer>();
		for(int i = 3; i < 55555; i++) {
			if(isCheck(i)) {
				list.add(i);
			}
		}

//		ArrayList<Integer> ans = new ArrayList<Integer>();
//		ans.add(2);
		int []k = new int[N];
		k[0] = 2;
		int cnt = 0;
		for(int i = 0; i < list.size(); i++) {
			int a = list.get(i);
			if(a % 5 == 1) {
				cnt++;
				k[cnt] = a;
			}
			if(cnt == N - 1) {
				break;
			}
		}
		for(int i = 0; i < N; i++) {
			if(i != 4) {
				System.out.print(k[i] + " ");
			}else {
				System.out.println(k[i]);
			}

		}

	}
	public static boolean isCheck(int n) {
		for(int i = 2; i < n; i++) {
			if(n % i == 0) {
				return false;
			}
		}
		return true;
	}
}