#include <bits/stdc++.h>
using namespace std;
int a[7] = {0, 2, 3, 5, 7, 11, 13};
int n, m, ans[1000000], s, maxx, nm;
void dfs(int x, int t) {
  if (t > nm) {
    ans[++m] = x;
    return;
  }
  dfs(x, t + 1);
  while (x * a[t] <= maxx) x *= a[t], dfs(x, t + 1);
}
int main() {
  scanf("%d", &n);
  maxx = n * n * 2;
  do {
    m = 0;
    ++nm;
    dfs(1, 1);
  } while (m < 2 * n);
  sort(ans + 1, ans + m + 1);
  for (int j = 0; j < n; j++) printf("%d ", ans[m - j]);
}
