#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 7;
const int M = 20;
const int inf = (int)1e9 + 7;
const long long base = (long long)1e18;
const double pi = acos(-1);
const double ep = 1e-18;
int p[10] = {2, 3, 5, 7, 11, 13, 17, 19};
vector<int> res;
void solve() {
  int n;
  cin >> n;
  int lm = 2 * n * n;
  for (int i = 0; i < 9; i++) {
    res.clear();
    res.push_back(1);
    for (int j = 0; j <= i; j++) {
      int m = res.size();
      for (int t = 0; t < m; t++) {
        int x = res[t] * p[j];
        while (x < lm) {
          res.push_back(x);
          x *= p[j];
        }
      }
    }
    if (res.size() >= n) {
      sort(res.begin(), res.end());
      reverse(res.begin(), res.end());
      for (int i = 0; i < n; i++) cout << res[i] << " ";
      return;
    }
  }
}
int main() {
  solve();
  return 0;
}
