#include <bits/stdc++.h>
const long double PI = 3.141592653589793238L;
const long long N = 1000005, MOD = 1000000007;
using namespace std;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  vector<long long> p = {2, 3, 5, 7, 11, 13};
  long long n;
  cin >> n;
  vector<long long> ans;
  for (long long i = (long long)(1); i <= (long long)(5); ++i) {
    ans.clear();
    ans.push_back(1);
    for (long long j = (long long)(0); j <= (long long)(i); ++j) {
      long long size = ((long long)(ans).size());
      for (long long k = (long long)(0); k <= (long long)(size - 1); ++k) {
        long long x = ans[k];
        while (x * p[j] <= 2 * n * n) x *= p[j], ans.push_back(x);
      }
    }
    if (((long long)(ans).size()) >= n) break;
  }
  sort(ans.rbegin(), ans.rend());
  for (long long i = (long long)(0); i <= (long long)(n - 1); ++i)
    cout << ans[i] << " ";
  cout << '\n';
  return 0;
}
