#include <bits/stdc++.h>
using namespace std;
const int INF = (1 << 30) - 1;
const long double EPS = 1e-9;
const long double PI = fabsl(atan2l(0.0, -1.0));
const int MAXN = 10000;
const int MAXK = 5010;
bool prime[MAXN + 5];
int primes[MAXN];
int cntPrimes = 0;
void calcPrimes() {
  memset(prime, true, sizeof(prime));
  for (int i = 2; i <= MAXN; i++) {
    if (prime[i]) {
      primes[cntPrimes++] = i;
      for (int j = 2 * i; j <= MAXN; j += i) {
        prime[j] = false;
      }
    }
  }
}
int a[1111111];
bool check(int k, int taken) {
  for (int i = 0; i < k; i++) {
    if (a[i] > 2 * k * k) {
      return false;
    }
  }
  for (int i = 0; i < taken; i++) {
    int p = primes[i];
    int cnt = 0;
    for (int j = 0; j < k; j++) {
      cnt += a[j] % p == 0;
    }
    if (cnt < k / 2) {
      return false;
    }
  }
  for (int i = 0; i < k; i++) {
    for (int j = i + 1; j < k; j++) {
      if (a[i] == a[j]) {
        ;
        throw;
        return false;
      }
    }
  }
  return true;
}
int b[MAXK];
void solve(int k) {
  int bound = 2 * k * k;
  for (int taken = 2;; taken++) {
    int size = 1;
    a[0] = 1;
    for (int i = 0; i < taken; i++) {
      int oldSize = size;
      int bound2 = bound;
      for (int j = i + 1; j < taken; j++) {
        bound2 /= primes[j];
      }
      for (int j = 0; j < oldSize; j++) {
        long long x = a[j] * 1LL * primes[i];
        while (x <= bound2) {
          a[size++] = x;
          x *= primes[i];
        }
      }
      if (size >= k) {
        break;
      }
    };
    if (size >= k) {
      for (int i = 0; i < k; i++) {
        b[i] = a[size - i - 1];
      }
      for (int i = 0; i < k; i++) {
        a[i] = b[i];
      }
    }
    if (size >= k && check(k, taken)) {
      break;
    }
  }
  sort(a + 0, a + k);
  for (int i = 0; i < k; i++) {
    if (i > 0) {
      printf(" ");
    }
    printf("%d", a[i]);
  }
}
int main() {
  clock_t start = clock();
  calcPrimes();
  int k;
  scanf("%d", &k);
  solve(k);
  ;
  return 0;
}
