#include <bits/stdc++.h>
using namespace std;
template <class A, class B>
A cvt(B x) {
  stringstream s;
  s << x;
  A r;
  s >> r;
  return r;
}
typedef vector<int> VI;
typedef vector<pair<int, int> > VII;
typedef vector<string> VS;
int a[123456];
int main() {
  int n;
  scanf("%d", &n);
  vector<int> v;
  set<int> s;
  bool prime;
  for (int i = 2; i < 600; i++) {
    prime = true;
    for (int j = 2; j < i; j++) {
      if (i % j == 0) {
        prime = false;
        break;
      }
    }
    if (prime) v.push_back(i);
  }
  int cnt = 0, mark = 0;
  for (int i = 0; i < v.size(); i++) {
    for (int j = i; j < v.size(); j++) {
      for (int k = j; k < v.size(); k++) {
        if (v[i] * v[j] * v[k] < 10000000) {
          a[mark++] = v[i] * v[j] * v[k];
          cnt++;
        }
        if (cnt >= n) break;
      }
      if (cnt >= n) break;
    }
    if (cnt >= n) break;
  }
  sort(a, a + n);
  for (int i = (int)0; i < (int)n; ++i) {
    printf("%d ", a[i]);
    ;
  }
  cout << endl;
  return 0;
}
