#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long infLL = 0x3f3f3f3f3f3f3f3fLL;
const int hash_mod = 1000037;
const double pi = acos(-1);
const double eps = 1e-10;
int k, c;
int prime[] = {2, 3, 5, 7, 11};
int cnt[5];
vector<long long> res;
void dfs(long long cur, int id) {
  if (id == c) {
    res.push_back(cur);
    return;
  }
  while (cur < 2 * k * k) {
    dfs(cur, id + 1);
    cur *= prime[id];
  }
}
bool check() {
  res.clear();
  dfs(1, 0);
  if (res.size() < k) return false;
  sort(res.begin(), res.end());
  reverse(res.begin(), res.end());
  memset(cnt, 0, sizeof(cnt));
  for (int i = 0; i < k; ++i)
    for (int j = 0; j < c; ++j)
      if (res[i] % prime[j] == 0) ++cnt[j];
  for (int j = 0; j < c; ++j)
    if (cnt[j] * 2 < k) return false;
  return true;
}
int main() {
  scanf("%d", &k);
  c = 1;
  while (!check()) ++c;
  printf("%d", res[0]);
  for (int i = 1; i < k; ++i) printf(" %d", res[i]);
  puts("");
  return 0;
}
