#include <bits/stdc++.h>
using namespace std;
const int N = 4005;
int prime[] = {2, 3, 5, 7, 11, 13, 17, 19}, k;
int main() {
  cin >> k;
  vector<int> ans;
  for (int use = 1; use <= 8; use++) {
    ans.clear();
    ans.push_back(1);
    for (int j = 0; j < use; j++) {
      for (int r = 0; r < ans.size(); r++) {
        int t = ans[r];
        if (t * prime[j] <= k * k * 2) {
          t = t * prime[j];
          ans.push_back(t);
        }
      }
    }
    if (ans.size() > k) break;
  }
  sort(ans.begin(), ans.end());
  for (int i = ans.size() - k; i < ans.size(); i++) {
    cout << ans[i] << " ";
  }
  return 0;
}
