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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;

public class Main {

	public static void main(String[] args) throws NumberFormatException, IOException {

		// 解説見た後

		// 標準入力
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		int n = Integer.parseInt(br.readLine());

		ArrayList<Integer> nums = new ArrayList<Integer>();

		int so = 7;

		for (int i = 0; i < n; i++) {
			while (true) {
				so++;
				boolean sosuflag = true;
				for (int j = 2; j < so; j++) {
					if (so % j == 0) {
						sosuflag = false;
						break;
					}
				}
				if (sosuflag && so % 5 == 1) {
					nums.add(so);
					break;
				}
			}

		}

		StringBuilder sb = new StringBuilder();
		for (int i = 0; i < n; i++) {
			sb.append(nums.get(i) + " ");
		}
		sb.deleteCharAt(sb.length() - 1);
		System.out.println(sb);

	}

}