#include <bits/stdc++.h>
using namespace std;
const int pri[] = {2, 3, 5, 7, 11, 13};
int k, num, ans[100010];
void dfs1(int o, int zong, int pr) {
  if (o > 2 * k * k) return;
  if (pr < 0) {
    ++num;
    ans[num] = o;
    return;
  }
  int nowo = o, nowzong = zong;
  while (zong > pri[pr]) {
    if (num > k) return;
    zong /= pri[pr];
    o *= pri[pr];
    dfs1(o, zong, pr - 1);
  }
  dfs1(nowo, nowzong, pr - 1);
}
int main() {
  scanf("%d", &k);
  int i;
  for (i = 0; i <= 5; ++i) {
    num = 0, dfs1(1, 2 * k * k, i);
    if (num >= k) break;
  }
  num = 0, dfs1(1, 2 * k * k, i);
  for (int i = 1; i <= k; ++i) printf("%d ", ans[i]);
}
