#include <bits/stdc++.h>
using namespace std;
int k;
map<int, bool> vis;
vector<pair<int, int> > aa;
vector<int> p;
int MAX;
void rec(int n, int prime) {
  if (vis[n] == 1) return;
  if (n > MAX) return;
  aa.push_back({prime, n});
  vis[n] = 1;
  for (int i = 0; i < p.size(); i++) {
    if (n % p[i] != 0)
      rec(n * p[i], prime + 1);
    else
      rec(n * p[i], prime);
  }
}
bool solve() {
  aa.clear();
  vis.clear();
  rec(1, 0);
  if (aa.size() < k) return 0;
  sort(((aa).rbegin()), ((aa).rend()));
  return 1;
}
int rr[100];
int main() {
  cin >> k;
  MAX = (2 * k * k);
  for (int i = 2; i < 100; i++)
    if (rr[i] == 0) {
      for (int j = i + i; j < 100; j += i) rr[j] = 1;
      p.push_back(i);
      if (solve()) break;
    }
  for (int i = 0; i < k; i++) cout << aa[i].second << " ";
  cout << endl;
  return 0;
}
