#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using ull = unsigned long long;

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  constexpr array<int, 9> pr = { 2, 3, 5, 7, 11, 13, 17, 19, 23 };
  int x = 1;
  for (int p : pr) x *= p;
  int n;
  cin >> n;
  vector<int> ans(n);
  rep(i, n - 1) ans[i] = x / pr[i];
  ans[n - 1] = x;

  {
    set<ll> st;
    for (int x1 : ans) {
      for (int x2 : ans) {
        if (x1 == x2) continue;
        st.insert(lcm((ll) x1, (ll) x2));
      }
    }
    assert(st.size() == 1);
  }

  rep(i, n) cout << ans[i] << ' ';
  cout << '\n';
  return 0;
}