Problem:
Score: 400 points

Problem Statement

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.

Notes

An integer N not less than 2 is called a prime number if it cannot be divided evenly by any integers except 1 and N, and called a composite number otherwise.

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.

Sample Input 1

5

Sample Output 1

3 5 7 11 31

Let us see if this output actually satisfies the conditions.

First, 3, 5, 7, 11 and 31 are all different, and all of them are prime numbers.

The only way to choose five among them is to choose all of them, whose sum is a_1+a_2+a_3+a_4+a_5=57, which is a composite number.

There are also other possible outputs, such as 2 3 5 7 13, 11 13 17 19 31 and 7 11 5 31 3.

Sample Input 2

6

Sample Output 2

2 3 5 7 11 13

2, 3, 5, 7, 11, 13 are all different prime numbers.

2+3+5+7+11=28 is a composite number.

2+3+5+7+13=30 is a composite number.

2+3+5+11+13=34 is a composite number.

2+3+7+11+13=36 is a composite number.

2+5+7+11+13=38 is a composite number.

3+5+7+11+13=39 is a composite number.

Thus, the sequence 2 3 5 7 11 13 satisfies the conditions.

Sample Input 3

8

Sample Output 3

2 5 7 13 19 37 67 79

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)




#include <bits/stdc++.h>


using namespace std;


#define uniq(x)  x.erase(unique(x.begin(),x.end()), x.end()) //Unique value find from vector
#define upper(arr,n,fixed) upper_bound(arr,arr+n,fixed)-arr  //Upper value search  >
#define lower(arr,n,fixed) lower_bound(arr,arr+n,fixed)-arr  //Lower value search  >=
#define FOR(i,a,n) for(int i=a; i<(int)n; i++)
#define FORI(i,a,n) for(int i=a; i>=(int)n; i--)
#define pii pair<int,int>
#define vpii vector<pii>
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define sz(a) int((a).size())
#define fastIO() ios_base::sync_with_stdio(0); cin.tie(0)
#define endl "\n"
#define all(a) a.begin(), a.end()
#define MEMSET(p,i) memset(p,i,sizeof(p))

#define MAX 55556

vector<bool> crivo(MAX,true);
vector<int> primos;
void geraPrimos()
{
	crivo[0] = crivo[1] = false;
	int lim = sqrt(MAX);
	for(int i = 2; i <= lim; i++)
	{
		if(crivo[i])
		{
			int k = 0;
			for(int j = i*i; j <= MAX; j = i + i*k)
			{
				crivo[j] = false;
				k++;
			}
		}
	}

	FOR(i,2,MAX)
		if(crivo[i])
			primos.pb(i);
}




int main(void)
{
	fastIO();

	geraPrimos();

	
	int n;
	cin >> n;

	queue<int> Q;

	int p = 0;
	int ans = 0;
	while(sz(Q) != n){
		ans += primos[p];
		Q.push(primos[p++]);
	}

	while(crivo[ans]){
		ans -= Q.front();
		Q.pop();
		ans += primos[p];
		Q.push(primos[p++]);
	}

	p = 0;
	while(!Q.empty()){
		if(p != 0)
			cout << " ";
		cout << Q.front();
		Q.pop();
		p++;
	}
	cout << endl;



	

	
	

	return 0;
}