#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> x;
bool prime(int n) {
  for (int a = 2; a < n; a++)
    if (n % a == 0) return false;
  return true;
}
int main() {
  scanf("%d", &n);
  int limit = 2 * n * n;
  int p = 1;
  while (x.size() < n) {
    p++;
    while (!prime(p)) p++;
    x.push_back(p);
    for (int a = 0; a < x.size(); a++)
      if (p * x.at(a) < limit) x.push_back(p * x.at(a));
  }
  sort(x.begin(), x.end(), greater<int>());
  for (int a = 0; a < n; a++) {
    printf("%d", x[a]);
    if (a != n - 1)
      printf(" ");
    else
      printf("\n");
  }
  return 0;
}
