#include <bits/stdc++.h>
using namespace std;
const int prime[15] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};
int n;
vector<int> ans;
int main() {
  scanf("%d", &n);
  int m = n * n * 2;
  for (int i = 0; i < 15; i++) {
    ans.clear();
    ans.push_back(1);
    for (int j = 0; j <= i; j++) {
      int p = prime[j];
      int size = (int)ans.size();
      for (int k = 0; k < size; k++) {
        int x = ans[k];
        while (x * p <= m) {
          x *= p;
          ans.push_back(x);
        }
      }
    }
    if ((int)ans.size() >= n) break;
  }
  int size = (int)ans.size() - 1;
  for (int i = n - 1; i >= 0; i--)
    printf("%d%c", ans[size - i], i == 0 ? '\n' : ' ');
  return 0;
}
