#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
int p[] = {2, 3, 5, 7, 11};
int f[100010];
int st;
bool cmp(int u, int v) {
  int cntu = 0, cntv = 0;
  for (int i = 0; i < st; i++) {
    if (u % p[i] == 0) cntu++;
    if (v % p[i] == 0) cntv++;
  }
  if (cntu > cntv) return 1;
  if (cntu == cntv and u > v) return 1;
  return 0;
}
int main() {
  int k;
  scanf("%d", &k);
  if (k < 1000)
    st = 4;
  else
    st = 5;
  int n = 1;
  f[0] = 1;
  for (int i = 0; i < st; i++) {
    int m = n;
    for (int j = 0; j < m; j++) {
      int q = p[i];
      while (q * f[j] <= 2 * k * k) {
        f[n++] = q * f[j];
        q *= p[i];
      }
    }
  }
  sort(f, f + n, cmp);
  for (int i = 0; i < k; i++) printf("%d ", f[i]);
  return 0;
}
