#include <bits/stdc++.h>
using namespace std;
const int maxn = 10002;
const int maxm = 15000002;
int f[maxm], p[maxn];
bool v[maxn];
int a[maxn];
int n, m, s;
int main() {
  int i, j;
  for (i = 2; i < 12; i++) {
    if (!v[i]) p[s++] = i;
    for (j = 0; j < s && i * p[j] < 12; j++) {
      v[i * p[j]] = 1;
      if (i % p[j] == 0) break;
    }
  }
  for (i = 2; i < maxm; i++)
    if (!f[i])
      for (j = i; j < maxm; j += i) f[j] = i;
  scanf("%d", &n);
  m = 1;
  for (j = 0; j < s; ++j) {
    m *= p[j];
    if (m > n) break;
  }
  --j;
  m = 0;
  for (i = 2; i <= 2 * n * n && i < maxm; ++i)
    if (f[i] <= p[j]) {
      a[m++] = i;
    }
  sort(a, a + m);
  reverse(a, a + m);
  for (i = 0; i < n; ++i) printf("%d ", a[i]);
  puts("");
  return 0;
}
