#include <bits/stdc++.h>
using namespace std;
int chk[5010];
long long f;
int cnt;
int p[5010], num[5010], sub[5010];
short visit[50000010];
int k;
int tmp;
int h;
int all;
long long o[5010];
void fd(long long z) {
  if (z > tmp) return;
  if (visit[z] == h) return;
  if (all == k) return;
  o[all] = z;
  all++;
  visit[z] = h;
  for (int i = 0; i < cnt; i++) {
    fd(z * p[i]);
  }
}
int main() {
  chk[1] = 1;
  for (int i = 2; i * i <= 5000; i++) {
    if (chk[i]) continue;
    for (int j = i * i; j <= 5000; j += i) chk[j] = 1;
  }
  scanf("%d", &k);
  tmp = k * k * 2;
  f = 1;
  for (int i = 2; i <= 5000; i++) {
    if (chk[i]) continue;
    p[cnt] = i;
    cnt++;
    f *= i;
    if (f > tmp) break;
    all = 0;
    h++;
    fd(f);
    for (int s = 0; s < cnt; s++) {
      for (int r = s + 1; r < cnt; r++) {
        f /= p[s];
        f /= p[r];
        fd(f);
        f *= p[s];
        f *= p[r];
      }
    }
    if (all == k) {
      sort(o, o + k);
      for (int j = 0; j < k; j++) printf("%lld ", o[j]);
      break;
    }
    sub[i] = 1;
  }
  return 0;
}
