#include <iostream>
#include <vector>
#include <algorithm>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
#define rep(i, n) for (int i = 0; i< (int)(n); i++) 

bool isprime(ll a){
    if(a < 2)return false;
    for(ll i = 2; i*i <= a; i++){
        if(a%i == 0)return false;
    }
    return true;
}

int main(){
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int n; cin >> n;
    ll a = 1;
    ll base = 1;rep(i, n-1)base *= 2;
    rep(i, n){
        while(!isprime(a))a++;
        cout << base*a << " ";
        a += a+1;
        base /= 2;
    }cout << endl;

    return 0;
}