Problem: 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

Solution (in CPP):

Solution:
#include <bits/stdc++.h>

using namespace std;

bool p[66666];

int main()
{
	for (int i = 2; i < 333; i++) {
		if (p[i]) continue;
		for (int j = i * i; j < 66666; j += i)
			p[j] = true;
	}
	int n;
	cin >> n;
	for (int i = 3; n; i += 10)
		if (!p[i]) n--, cout << i << ' ';
	cout << endl;
	return 0;
}