#include <bits/stdc++.h>
using namespace std;
int primos[] = {2, 3, 5, 7, 11, 13, 17, 23, 29, 31, 37, 41};
int main() {
  set<int> resp;
  resp.insert(1);
  int n;
  cin >> n;
  for (int i = 0; resp.size() < n; i++) {
    resp.insert(primos[i]);
    for (set<int>::iterator it = resp.begin(); it != resp.end(); it++) {
      if ((*it) * primos[i] <= 2 * n * n) {
        resp.insert((*it) * primos[i]);
      }
    }
  }
  vector<int> ans;
  for (set<int>::iterator it = resp.begin(); it != resp.end(); it++) {
    ans.push_back((*it));
  }
  sort(ans.begin(), ans.end());
  reverse(ans.begin(), ans.end());
  for (int i = 0; i < n; i++) {
    cout << ans[i] << " ";
  }
  cout << endl;
}
