#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	int n; cin >> n;
	int mx = 12345678;
	vector<bool> pl(mx+1);
	vector<int> p;
	for (int i=2; i<=mx; i++){
		if (pl[i]) continue;
		pl[i] = 1;
		p.push_back(i);
		for (int j=i; j<=mx; j+=i){
			pl[j] = 1;
		}		
	}

	vector<int> ans;
	rep(i,0,n){
		ans.push_back(p[i] * p[i+1]);
	}
	reverse(ans.begin(), ans.end());

	int tar = n + 2;
	int piv = 1;
	while (piv < n){
		if (ans[piv] * p[tar] > ans[piv-1]){
			ans[piv] *= p[tar];
			piv++;
		}
		tar++;
	}

	rep(i,0,n){
		cout << ans[i];
		if (i == n-1) cout << '\n';
		else cout << ' ';
	}
}