#include <bits/stdc++.h>

#define Mod 998244353

using namespace std;



typedef long long ll;
 
 
inline int read() {
	int out = 0;
	bool flag = false;
	register char cc = getchar();
	while (cc < '0' || cc > '9') {
		if (cc == '-') flag = true;
		cc = getchar(); 
	}
	while (cc >= '0' && cc <= '9') {
		out = (out << 3) + (out << 1) + (cc ^ 48);
		cc = getchar();
	}
	return flag ? -out : out;
}
 
inline void write(int x, char ch) {
	if (x < 0) putchar('-'), x = -x;
	if (x == 0) putchar('0');
	else {
		int num = 0;
		char cc[22];
		while (x) cc[++num] = x % 10 + 48, x /= 10;
		while (num) putchar(cc[num--]);
	}
	putchar(ch);
}

int fpow(int x, int y) {
	int res = 1;
	while (y) {
		if (y & 1) res = 1ll * res * x % Mod;
		x = 1ll * x * x % Mod;
		y >>= 1;
	}
	return res;
}


int n, a[2510];

int main() {
	n = read();
	if (n <= 1668) {
		a[1] = 6, a[n - 1] = 10, a[n] = 15;
		for (int i = 1; i < n - 1; i++) a[i] = 6 * i;	
	}
	else {
		int cnt = 0;
		for (int i = 1; i <= 1666; i++) if (i % 5 != 0) a[++cnt] = 6 * i;
		for (int i = cnt + 1; i <= min(cnt + 1000, n - 1); i++) a[i] = 10 * (i - cnt);
		cnt += 1000; if (cnt > n - 1) cnt = n - 1;
		for (int i = cnt + 1, t = 1; i <= n; i++, t += 2) a[i] = 15 * t;
	}
	for (int i = 1; i <= n; i++) write(a[i], ' ');
	return 0;
}
#include <bits/stdc++.h>
using namespace std;
//const long nPrime = 1000000007;
//const long nPrime = 998244353;
int main() {
    int n;
    cin >> n;
    vector<long> viAns = {6,10,15};
    for(long i = 2; 6*i < 10000; i++){
        viAns.push_back(6*i);
    }
    for(long i = 2; 10*i < 10000; i++){
        viAns.push_back(10*i);
    }
    for(long i = 2; 15*i < 10000; i++){
        viAns.push_back(15*i);
    }
    
    vector<int> viCheck(10000,0);
    int i = 0;
    while(n>0){
        if(viCheck[viAns[i]] == 0){
            cout << viAns[i] << " ";
            n--;
            viCheck[viAns[i]] = 1;
        }
        i++;
    }
    return 0;
}