#include <bits/stdc++.h>
using namespace std;
int a, b, c, d, e, f, g, h, i, j, k;
vector<int> F;
int prime[5005], v[5005], tot;
int tmp;
void Pre() {
  for (i = 2; i <= a; i++)
    if (v[i] == 0) {
      prime[++tot] = i;
      for (j = 2; i * j <= a; j++) v[i * j] = 1;
    }
}
int main() {
  cin >> a;
  F.push_back(1);
  Pre();
  for (i = 1; i <= tot; i++) {
    e = F.size();
    for (j = 0; j < e; j++) {
      tmp = F[j] * prime[i];
      while (tmp <= 2 * a * a) {
        F.push_back(tmp);
        tmp *= prime[i];
      }
    }
    if (F.size() >= a) break;
  }
  e = F.size() - 1;
  for (i = 1; i <= a; i++) cout << F[e--] << " ";
  cout << endl;
  return 0;
}
