#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '{';
    for(int i = 0; i < (int)v.size(); i++) {
        if(i) { os << ','; }
        os << v[i];
    }
    os << '}';
    return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
    cerr << " " << x;
    debugg(args...);
}
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = (1<<30)-1;
const ll linf = 1LL<<61;
const int MAX = 510000;
int dy[8] = {0,1,0,-1,1,-1,-1,1};
int dx[8] = {-1,0,1,0,1,-1,1,-1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T> inline void print(T &a){
    int sz = a.size();
    for(auto itr = a.begin(); itr != a.end(); itr++){
		cout << *itr;
        sz--;
        if(sz) cout << " ";
	}
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){
	cout << a << " " << b << "\n";
}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
void mark() {cout << "#" << "\n";}
ll pcount(ll x) {return __builtin_popcountll(x);}
const int mod = 1e9 + 7;
//const int mod = 998244353;

ll GCD(ll a, ll b){
    if(b==0) return a;
    else return GCD(b,a%b);
}

int main(){
    int n; cin >> n;
    cout << "6 10 15";
    n -= 3;
    int now = 2;
    while(n > 0){
        if(now * 6 > 10000) break;
        cout << " " << now*6;
        n--;
        now++;
    }
    now = 2;
    while(n > 0){
        if(now*10 > 10000) break;
        if((now*10) % 6 == 0){
            now++; continue;
        }
        cout << " " << now*10;
        n--;
        now++;
    }
    now = 2;
    while(n > 0){
        int t = now*15;
        if(t % 6 == 0 || t % 10 == 0){
            now++; continue;
        }
        cout << " " << t;
        n--;
        now++;
    }
    cout << endl;
}
#include<bits/stdc++.h>

using namespace std;

const int N = 4e5 + 213;

int a[N];
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int n;
	cin >> n;

	a[1] = 2 * 5;
	a[n] = 5 * 3;
	int x = 1;
	int len = 2;

	for(int i = 1; i <= 10000; i++) {
		if(i != a[1] && i != a[n] && ((i % 2 == 0 && (i % 3 == 0 or i % 5 == 0)) or (i % 3 == 0 and i % 5 == 0))) {
			if(len == n) break;
			a[len] = i;
			len++;
		}
	}
	int g = 0;
	for(int i = 1; i <= n; i++)
		cout << a[i] << ' ',g = __gcd(g, a[i]);
//	cout << endl;
//	cout << g << ' ';

	bool ok = 1;

	for(int i = 1; i <= n; i++)
	for(int j = i + 1; j <= n; j++)
		ok &= (__gcd(a[i], a[j]) > 1);
//	cout << ok;
	return 0;
}

	 