#include <bits/stdc++.h>
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const int MAXN = 5e3 + 5;
const double eps = 1e-9;
using namespace std;
int pr[9] = {2, 3, 5, 7, 11, 13, 17, 19, 23};
int ans[MAXN * MAXN];
int main() {
  int k;
  scanf("%d", &(k));
  int cnt = 1;
  ans[0] = 1;
  for (int i = 0; cnt < k; i++)
    for (int j = 0; j < cnt; j++)
      if (ans[j] * pr[i] <= 2 * k * k) ans[cnt++] = ans[j] * pr[i];
  for (int i = 0; i < k; i++) printf("%d ", ans[cnt - k + i]);
  printf("\n");
  return 0;
}
