#include <bits/stdc++.h>
using namespace std;
vector<int> ans;
int K, pr[20] = {2,  3,  5,  7,  11, 13, 17, 19, 23,
                 29, 31, 37, 41, 43, 47, 53, 59, 61};
int v[222222], sz;
void dfs(int idx, int x, int n) {
  if (idx == n) {
    v[sz++] = x;
    return;
  }
  long long t = x;
  for (int i = 0; i < 5; ++i) {
    dfs(idx + 1, t, n);
    if (t * pr[idx] > 2 * K * K) break;
    t *= pr[idx];
  }
}
int main() {
  scanf("%d", &K);
  for (int i = 0;; ++i) {
    sz = 0, dfs(0, 1, i);
    if (sz < 2 * K) continue;
    sort(v, v + sz);
    for (int j = 0; j < K; ++j) printf("%d ", v[sz - 1 - j]);
    return 0;
  }
}
