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

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<int> ans(n, 1);
    vector<bool> tb(251, true);
    tb[0] = tb[1] = false;
    vector<int> p;
    for(int i = 2; i <= 250; i++){
        if(!tb[i]) continue;
        p.push_back(i);
        p.push_back(i * i);
        if(i < 10){
            p.push_back(i * i * i);
            p.push_back(i * i * i * i);
            p.push_back(i * i * i * i * i);
        }
        for(int j = 2 * i; j <= 250; j += i) tb[j] = false;
    }
    sort(p.begin(), p.end());
    for(int i = 0; i + 2 < n; i++){
        ans[n - 2 - i] = lcm(ans[n - 2 - i], p[i + 1]);
        ans[n - 3 - i] = lcm(ans[n - 3 - i], p[i + 1]);
    }
    for(int i = 0; i < n; i++){
        if(i >= 1 && ans[i - 1] >= ans[i]){
            int d = ans[i - 1] / ans[i] + 1;
            while(gcd(d, ans[i - 1]) != 1 || (i + 1 < n && gcd(d, ans[i + 1]) != 1)) d++;
            ans[i] *= d;
        }
        //if(i >= 1) cerr << gcd(ans[i - 1], ans[i]) << " ";
        cout << ans[i] << (i + 1 == n ? '\n' : ' ');
    }
}