#include <bits/stdc++.h>
using namespace std;
const int N = 10;
const int prm[N] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29};
int main() {
  int n;
  while (cin >> n) {
    set<long long> ans;
    for (int i = 0; i < N && ans.size() < n; i++) {
      ans.insert(prm[i]);
      for (set<long long>::iterator si = ans.begin(); si != ans.end(); si++) {
        if (*si * prm[i] > 2 * n * n) break;
        ans.insert(*si * prm[i]);
      }
    }
    for (set<long long>::reverse_iterator si = ans.rbegin();
         si != ans.rend() && n--; si++) {
      cout << *si;
      if (n)
        cout << ' ';
      else
        cout << endl;
    }
  }
  return 0;
}
