#include <bits/stdc++.h>
using namespace std;
int a[5000],
    prime[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53};
int main() {
  int n;
  cin >> n;
  int m = 0, c, k;
  a[m++] = 1;
  for (k = 0; m < n; ++k) {
    int tm = m;
    c = 0;
    for (int i = 0; i < tm; ++i) {
      int p = prime[k];
      while (m < n && a[i] * p <= 2 * n * n) {
        a[m++] = a[i] * p;
        ++c;
        p *= prime[k];
      }
    }
    sort(a, a + m);
  }
  --k;
  for (int i = 0; i < n; ++i) {
    int pos = lower_bound(a + i, a + n, a[i] * prime[k]) - a;
    if (a[i] * prime[k] <= 2 * n * n && a[pos] != a[i] * prime[k]) {
      a[i] *= prime[k];
      ++c;
    }
  }
  sort(a, a + n);
  for (int i = 0; i < n; ++i) cout << a[i] << " ";
  return 0;
}
