#include <bits/stdc++.h>
using namespace std;
vector<int> g;
int prime[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31};
int main() {
  int k;
  while (~scanf("%d", &k)) {
    g.clear();
    for (int i = 0; g.size() < k; i++) {
      g.push_back(prime[i]);
      for (int j = 0; j < g.size(); j++)
        if (prime[i] * g[j] <= 2 * k * k) g.push_back(prime[i] * g[j]);
    }
    for (int i = g.size() - 1; k > 0; k--, i--) printf("%d ", g[i]);
    puts("");
  }
  return 0;
}
