#include <bits/stdc++.h>
using namespace std;
int const N = 5050, M = 5;
int const pri[] = {2, 3, 5, 7, 11};
int n, m, d;
int cnt[M];
int ans[N * N * 2], t;
void dfs(long long x, int pos) {
  ans[t++] = x;
  for (int i = pos; i < d; ++i) {
    if (x * pri[i] <= m) dfs(x * pri[i], i);
  }
}
inline bool cmp(int const &x, int const &y) { return x > y; }
int main() {
  scanf("%d", &n);
  m = n * n * 2;
  for (d = 2; d <= 5; ++d) {
    memset(cnt, (0), sizeof cnt);
    t = 0;
    dfs(1LL, 0);
    if (t < n) continue;
    sort(ans, ans + t, cmp);
    for (int i = 0; i < (n); ++i)
      for (int j = 0; j < (d); ++j)
        if (ans[i] % pri[j] == 0) ++cnt[j];
    bool f = 1;
    for (int i = 0; i < (d); ++i)
      if (cnt[i] + cnt[i] < n) f = 0;
    if (f) {
      sort(ans, ans + n);
      for (int i = 0; i < (n); ++i) printf("%d ", ans[i]);
      puts("");
      break;
    }
  }
  return 0;
}
