#include <bits/stdc++.h>
using namespace std;
int simple[] = {2, 3, 5, 7, 11}, n;
set<int> var;
void calc(int i, int cur, int m) {
  var.insert(cur);
  if (i < n)
    for (int p = 1; cur * p <= m; p *= simple[i]) calc(i + 1, cur * p, m);
}
int main() {
  int k;
  scanf("%d", &k);
  vector<int> tmp;
  for (n = 1; n <= 5; ++n) {
    calc(0, 1, 2 * k * k);
    if (var.size() - 1 >= k) break;
    tmp = vector<int>(var.begin(), var.end());
  }
  for (int i = 0, c = 0; 2 * c < k || tmp.size() <= k; i++)
    if (tmp.size() <= k)
      for (int p = simple[n - 1]; tmp[i] * p <= 2 * k * k && tmp.size() <= k;
           p *= simple[n - 1])
        tmp.push_back(tmp[i] * p), c++;
    else
      tmp[i] *= simple[n - 1], c++;
  for (int i = 1; i <= k; ++i) printf("%d ", tmp[i]);
  printf("\n");
  return 0;
}
