#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using P = pair<int,int>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}

int main() {
  vector<int> p = {2, 3, 5, 7, 11, 13, 17, 19, 23};
  int n;
  cin >> n;
  if (n == 2) {
    cout << 2 << " " << 3 << endl;
    return 0;
  }
  vector<ll> ans;
  rep(i,0,n-1) {
    ll v = 1;
    rep(j,0,n-1) {
      if (i == j) continue;
      v *= p[j];
    }
    ans.eb(v);
  }
  ans.eb(ans[0]/__gcd(ans[0], ans[1])*ans[1]);
  rep(i,0,n) {
    cout << ans[i] << " \n"[i==(n-1)];
  }
  return 0;
}