#include <bits/stdc++.h>
using namespace std;
vector<int> primes{2, 3, 5, 7, 11, 13, 17, 23};
set<int> beautifulSet{1};
int main() {
  int n;
  scanf("%d", &n);
  for (auto &prime : primes) {
    if (beautifulSet.size() > n) break;
    for (auto &elem : beautifulSet) {
      if (prime * elem <= 2 * n * n) beautifulSet.insert(elem * prime);
    }
  }
  auto beginSet = beautifulSet.rbegin();
  for (int i = 0; i < n; i++) {
    cout << (*beginSet) << ' ';
    beginSet++;
  }
  cout << endl;
  return 0;
}
