#ifdef LOCAL111
	#define _GLIBCXX_DEBUG
#else
	#define NDEBUG
#endif
#define _USE_MATH_DEFINES
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>

#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif

// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
const int INF = 1e9;
using namespace std;
template<typename T, typename U> ostream& operator<< (ostream& os, const pair<T,U>& p) { os << '(' << p.first << ' ' << p.second << ')'; return os; }

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
	template<typename T> void dpite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
#else
	#define DEBUG(x) true
	template<typename T> void dpite(T a, T b){ return; }
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}

typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<int,int> P;

void ios_init(){
	//cout.setf(ios::fixed);
	//cout.precision(12);
#ifdef LOCAL111
	return;
#endif
	ios::sync_with_stdio(false); cin.tie(0);
}


// const int lm = 30000;
const int lm = 10;

template <typename T>
long long gcd(T x, T y){
	return y==0 ? x : gcd(y, x%y);
}

bool check(const vector<int>& v) {
    int sum = 0;
    set<int> s(ALL(v));
    if(SZ(s) != SZ(v)) return false;
    REP(i, SZ(v)) {
        if(v[i] > 30000) return false;
        sum += v[i];
    }
    int g = v[0];
    REP(i, SZ(v)) {
        g = gcd(g, v[i]);
    }
    if(g > 1) return false;
    REP(i, SZ(v)) {
        if(gcd(v[i], sum-v[i]) == 1) {
            return false;
        }
    }
    return true;
}

void enu(int n, vector<int>& v) {
    // DEBUG(n);
    if(n == 0) {
        // dpite(ALL(v));
        if(check(v)) dpite(ALL(v));
        return;
    }
    REP(i, lm) {
        v.push_back(i+1);
        enu(n-1, v);
        v.pop_back();
    }
}

void solve(int n) {
    if(n == 3) {
        cout << "2 5 63" << endl;
    } else if(n == 4) {
        cout << "2 5 20 63" << endl;
    } else {
        vector<int> ans;
        ans.push_back(2);
        ans.push_back(3);
        ans.push_back(4);
        ans.push_back(9);
        int cc = 20000-5000;
        int c0 = 6;
        int c2 = 8;
        int c4 = 10;
        int c3 = 15;
        const int lm = 30000;
        while(SZ(ans) < n-n%2) {
            if(c2 <= lm and c4 <= lm) {
                ans.push_back(c2);
                ans.push_back(c4);
                c2 += 6;
                c4 += 6;
            } else if(c3 <= lm and c3+6 <= lm) {
                ans.push_back(c3);
                c3 += 6;
                ans.push_back(c3);
                c3 += 6;
            } else {
                ans.push_back(c0);
                c0 += 6;
            }
        }
        if(n%2) {
            ans.push_back(c0);
            c0 += 6;
        }
        DEBUG(SZ(ans));
        assert(SZ(ans) == n);
        assert(check(ans));
        pite(ALL(ans));
    }
}


int main()
{
	ios_init();
    // auto t = vector<int>();
    //     enu(6,t);
    int n;
    while(cin >> n) {
        solve(n);
    }
	return 0;
}


Measured memory_bytes: 640