#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
typedef long long ll;
const int INF = 1<<30;
const ll INFLL = 1LL<<60;
const ll MOD = 998244353;
const double INFD = 1.0E18;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, -1, 0, 1};
//const int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
//const int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
using Pair = pair<ll, ll>;
using Graph = vector<vector<pair<int, int>>>;
using mint = atcoder::modint1000000007;


int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);
    int n; cin >> n;
    if (n == 2){
        cout << 1 << ' ' << 2 << endl;
        return 0;
    }
    
    vector<ll> primes = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31};
    vector<ll> vec(n, 1);
    for (int i = 0; i < n; i++){
        for (int j = 0; j < n - 1; j++){
            if (i != j) vec[i] *= primes[j];
        }
    }
    
    for (int i = 0; i < n; i++) cout << vec[i] << (i == n - 1 ? '\n' : ' ');
    
        
    return 0;
}