#include <bits/stdc++.h>
using namespace std;
vector<int> ans;
int prime[] = {2, 3, 5, 7, 11};
int main() {
  int n;
  scanf("%d", &n);
  ans.push_back(1);
  for (int cas = (0); cas < (5); cas++) {
    if ((int)(ans).size() >= n) break;
    for (int i = (0); i < ((int)(ans).size()); i++)
      if (ans[i] * prime[cas] <= 2 * n * n) ans.push_back(ans[i] * prime[cas]);
  }
  for (int i = (1); i < (n + 1); i++) printf("%d ", ans[(int)(ans).size() - i]);
  return 0;
}
