#include <bits/stdc++.h>
using namespace std;
const int maxn = 5000 + 10;
int primes[10] = {2, 3, 5, 7, 11, 13, 17, 23};
int a[maxn * 10];
int main() {
  int n;
  scanf("%d", &n);
  int cnt = 0, pos = 0;
  while (cnt < n) {
    a[cnt++] = primes[pos];
    for (int i = 0; i < cnt; ++i)
      if (primes[pos] * a[i] <= 2 * n * n) a[cnt++] = primes[pos] * a[i];
    pos++;
  }
  for (int i = 1; i <= n; ++i) printf("%d ", a[cnt - i]);
  puts("");
  return 0;
}
