#include <bits/stdc++.h>
using namespace std;
int p[20] = {2,  3,  5,  7,  11, 13, 17, 19, 23,
             29, 31, 37, 41, 43, 47, 53, 59, 61};
int cnt[20];
int up, d[10000000], dn;
void dfs(int x, int v, int n) {
  if (x == n) {
    d[dn++] = v;
    return;
  }
  dfs(x + 1, v, n);
  while (v * p[x] <= up) {
    v *= p[x];
    dfs(x + 1, v, n);
  }
}
int main() {
  int(K);
  scanf("%d", &K);
  up = 2 * K * K;
  for (int i = 2;; i++) {
    dn = 0;
    dfs(0, 1, i);
    if (dn < K) continue;
    sort(d, d + dn);
    for (int j = 0; j < (K); ++j) {
      if (j) printf(" ");
      for (int k = 0; k < (i); ++k)
        if (d[dn - 1 - j] % p[k] == 0) cnt[k]++;
      printf("%d", d[dn - 1 - j]);
    }
    puts("");
    return 0;
  }
  return 0;
}
