#include <bits/stdc++.h>
 
using namespace std;
 
#define FOE(i, s, t) for (int i = s; i <= t; i++)
#define FOR(i, s, t) for (int i = s; i < t; i++)
#define FOD(i, s, t) for (int i = s; i >= t; i--)
#define K 400001
#define LL long long
#define mp make_pair
#define pb push_back
#define M 1000000007
#define pow qjwopjqpw

int n, a[K];

vector<int> good;

int main() {
	scanf("%d", &n);
	
	int b[4] = {3, 5, 7, 11};
	
	FOE(i, 1, 10000 / 2) {
		int cnt = 0;
		FOR(j, 0, 4) if (i % b[j] != 0) cnt++;
		
		if (cnt != 4) good.pb(i);
	}
		
	FOE(i, 1, n - 1) printf("%d ", good[i - 1] * 2);
	printf("%d\n", 3 * 5 * 7 * 11);
}
#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int> v = {6, 10, 15, 12, 18, 20, 24, 30};
    int cur = 0;
    int plus = 0;
    while (n--) {
        cout << v[cur] + plus << " ";
        cur++;
        if (cur == 8) {
            cur = 0;
            plus += 30;
        }
    }
    cout << endl;
}