#include <bits/stdc++.h>
using namespace std;
const double eps = 1.0e-11;
const double pi = acos(-1.0);
int primes[] = {2, 3, 5, 7, 11, 13};
int main() {
  int k;
  cin >> k;
  vector<pair<int, int> > res(1, make_pair(0, 1));
  for (long long use = 0; use < 6; use++) {
    vector<pair<int, int> > tmp = res;
    for (long long i = 0; i < (int)(res).size(); i++) {
      pair<int, int> curr = res[i];
      int t = curr.second * primes[use];
      while (t <= 2 * k * k) {
        tmp.push_back(make_pair(curr.first + 1, t));
        t *= primes[use];
      }
    }
    res.swap(tmp);
    if ((int)(res).size() < k) continue;
    sort((res).begin(), (res).end());
    reverse((res).begin(), (res).end());
    for (long long i = 0; i < k; i++) printf(" %d" + (i == 0), res[i].second);
    printf("\n");
    return 0;
  }
  return 0;
}
