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<iostream>
#include<math.h>
#include<vector>
using namespace std;
bool check(int k)
{
	for(int i=2;i<=sqrt(k);i++)
		if(k%i==0)
			return false;
	return true;
}
int main()
{
	int n;	cin>>n;
	vector<int> v;
	for(int i=6;i<=55555;i+=5)
	{
		if(check(i)==true)
		{
			v.push_back(i);
			n--;
		}
		if(n==0)
			break;
	}
	for(int i=0;i<v.size()-1;i++)
		cout<<v[i]<<" ";
	cout<<v[v.size()-1]<<endl;
}