#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#include <cassert>
#include <array>
#include <memory>
#include <random>
#include <complex>
#ifdef DEBUG
#include "./Lib/debug.hpp"
#include "./Lib/Timer.hpp"
#include "./Lib/sample.hpp"
#else
#define dump(...)
#endif

/* (=＾o＾=) */
//#define int ll

/* macro */
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)(e-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
#define cauto const auto&
/* macro func */
template<class T>
inline void sort(T& t) { std::sort(ALL(t)); }
template<class T>
inline void rsort(T& t) { std::sort((t).rbegin(), (t).rend()); }
template<class T>
inline void unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); }
template<class T, class S>
inline bool chmax(T& t, const S& s) { if (s > t) { t = s; return true; } return false; }
template<class T, class S>
inline bool chmaxE(T& t, const S& s) { if (s >= t) { t = s; return true; } return false; }
template<class T, class S>
inline bool chmin(T& t, const S& s) { if (s < t) { t = s; return true; } return false; }
inline void BR() { std::cout << "\n"; }

/* type define */
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VD = std::vector<double>;
template<class T>
using V = std::vector<T>;

/* using std */
using std::cout;
constexpr char endl = '\n';
using std::cin;
using std::pair;
using std::string;
using std::stack;
using std::queue;
using std::vector;
using std::list;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::set;
using std::unordered_set;
using std::unordered_multiset;
using std::multiset;
using std::bitset;
using std::priority_queue;
using std::tuple;

/* constant value */
//constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;

/* Initial processing  */
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;

/* Remove the source of the bug */
inline signed pow(signed, signed) { assert(false); return -1; }

/* define hash */
namespace std {
template <>	class hash<std::pair<ll, ll>> { public:	size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } };
}

/* input */
template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for (T& x : vec) is >> x; return is; }

//=============================================================================================

ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }

auto check(const list<ll>& ans) {
	ll sum = 0;
	ll g = gcd(*ans.begin(), *ans.rbegin());
	REPC(x, ans) { sum += x; g = gcd(g, x); }
	//dump(ans);
	//dump(sum);
	if (g != 1) {
		return false;
	}
	REPC(x, ans)if (gcd(sum - x, x) == 1) {
		return false;
	}
	return true;
}

auto solve(ll n) {

	if (n == 3) {
		return list<ll>{2, 5, 63};
	} else if (n == 4) {
		return list<ll>{2, 5, 20, 63};
	} else if (n == 5) {
		return list<ll>{2, 5, 20, 63,120};
	}

	list<ll> ans;
	ll sum = 0;
	ll cnt = 0;
	FOR(i, 1, 30001) {
		if (i % 2 == 0 || i % 3 == 0) {
			ans.emplace_back(i);
			sum += i;
			++cnt;
		}
		if (cnt == n) { break; }
	}
	if (n % 8 == 1) {
		for (auto&& x : ans)if (x == 12) { x = ans.back() + 2; }
	}
	if (n % 8 == 2) {
		for (auto&& x : ans) if (x == 9) { x = ans.back() + 1; }
	}
	if (n % 8 == 3) {
		for (auto&& x : ans)if (x == 9) { x = 30000; }
	}
	if (n % 8 == 4) {
		for (auto&& x : ans)if (x == 12) { x = ans.back() + 3; }
	}
	if (n % 8 == 5) {
		for (auto&& x : ans)if (x == 3) { x = ans.back() + 2; }
	}
	if (n % 8 == 6) {
		for (auto&& x : ans)if (x == 6) { x = ans.back() + 1; }
	}
	return ans;
}
signed main() {

	/**/
	ll n;
	cin >> n;
	auto ans = solve(n);
	REPC(x, ans) { cout << x << " "; }BR();
	/*/
	FOR(i, 3, 200) {
		auto ans = solve(i);
		if (!check(ans)) {
			dump(i);
			exit(1);
		}
	}
	/**/
}


Measured memory_bytes: 1024