#include <bits/stdc++.h>
using namespace std;
int ans[2001000];
int p[] = {2, 3, 5, 7, 11};
int ed;
bool cmp(int u, int v) {
  int x = 0, y = 0;
  for (int i = 0; i < ed; i++) {
    if (u % p[i] == 0) x++;
    if (v % p[i] == 0) y++;
  }
  if (x == y) return u > v;
  return x > y;
}
int main() {
  int n;
  scanf("%d", &n);
  int m = 1;
  ed = 5;
  if (n < 1000) ed = 4;
  ans[0] = 1;
  for (int i = 0; i < ed; i++) {
    int temp = m;
    for (int j = 0; j < temp; j++) {
      int t = p[i];
      while (t * ans[j] <= 2 * n * n) {
        ans[m++] = t * ans[j];
        t *= p[i];
      }
    }
  }
  sort(ans, ans + m, cmp);
  for (int i = 0; i < n; i++) printf("%d ", ans[i]);
  return 0;
}
