#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
const double eps = 1e-9;
const double INF = inf;
const double EPS = eps;
bool u[8123];
vector<int> Pr;
int n, r, ep;
int e, ne, Res[61232];
bool check() {
  int i;
  for (i = 0; i < ep; i++) {
    int cnt = 0;
    for (int j = e - n; j < e; j++)
      if (Res[j] % Pr[i] == 0) cnt++;
    if (cnt != 0 && 2 * cnt < n) return 0;
  }
  return 1;
}
void solve(int _n) {
  int i, tmp;
  n = _n, r = 2 * n * n;
  e = 1, Res[0] = 1, ep = 0;
  while (e < n) {
    ne = e;
    for (i = 0; i < e; i++) {
      tmp = Res[i];
      while (tmp * 1ll * Pr[ep] <= r) tmp *= Pr[ep], Res[ne++] = tmp;
    }
    e = ne, ep++;
  }
  assert(check());
  for (i = e - n; i < e; i++) printf("%d ", Res[i]);
  printf("\n");
}
int main() {
  int n, i, j;
  for (i = 2; i < 8123; i++)
    if (!u[i]) {
      Pr.push_back(i);
      for (j = i * i; j < 8123; j += i) u[j] = 1;
    }
  scanf("%d", &n), solve(n);
  ;
  return 0;
}
