#include <bits/stdc++.h>
using namespace std;
const int Maxn = 10000010;
int p[20] = {2, 3, 5, 7, 11, 13, 17, 19};
int a[Maxn];
int main() {
  int n;
  while (~scanf("%d", &n)) {
    int cnt = 1;
    a[0] = 1;
    int tmp = 2 * n * n;
    int ch;
    for (int i = 0;; i++) {
      for (int j = 0; j < cnt; j++) {
        if (p[i] * a[j] <= tmp) a[cnt++] = p[i] * a[j];
      }
      if (cnt > n) break;
    }
    for (int i = 0; i < n; i++) printf("%d ", a[cnt - 1 - i]);
    printf("\n");
  }
  return 0;
}
