#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for(int i=0;i<(n);++i)
#define rep1(i, n) for(int i=1;i<=(n);i++)
#define ll long long
using mint = modint998244353;
using P = pair<ll,ll>;
using lb = long double;
using T = tuple<ll, ll, ll>;
#ifdef LOCAL
#  include <debug_print.hpp>
#  define dbg(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define dbg(...) (static_cast<void>(0))
#endif

int main()
{
    int n;
    cin >> n;
    vector<int> prime;
    vector<bool> used((int)(1e3)+1);
    prime.push_back(1);
    for(int i=2;i<=(int)1e3;i++){
        if(used[i]) continue;
        prime.push_back(i);
        for(int j=i+i;j<=(int)(1e3);j+=i){
            used[j] = true;
        }
    }
    vector<ll> a(n, 1);
    rep(i,n-1){
        a[i+1] = prime[i]*prime[i+1];
    }
    a[n-1] /= prime[n-1];
    reverse(a.begin(),a.end());
    vector<int> g;
    for(int i=1;i<n;i++){
        int k = a[i-1]/a[i]+1;
        while(true){
            bool ok = true;
            for(int j=i-1;j<=min(i+1, n-1);j++){
                if(gcd(a[j], k)!=1) ok = false;
            }
            if(ok) {
                break;
            }
            k++;
        }
        a[i] *= k;
    }
    dbg(a);
    rep(i,n-1){
        g.push_back(gcd(a[i], a[i+1]));
        dbg(gcd(a[i], a[i+1]));
    }
    rep(i,n-2){
        assert(g[i]>g[i+1]);
    }
    rep(i,n){
        assert(a[i]<=(int)(1e8));
    }
    for(int i=0;i<n-1;i++){
        cout << a[i] << " ";
    }
    cout << a[n-1] << endl;
    return 0;
}