#include <bits/stdc++.h>   using namespace std;   int pr[] = {2, 3, 5, 7, 11, 13, 17, 19};   int big[50000005];   int c[10];   int ans[10100];   int main() {     int k;     scanf( %d , &k);     big[1] = 0;     for (int i = 0; i < 7; i++) big[pr[i]] = i + 1;     for (int i = 2; i <= 2 * k * k; i++) {       if (big[i] == 0) continue;       for (int j = 0; j < 7; j++) {         if (i * pr[j] <= 2 * k * k) {           big[i * pr[j]] = max(big[i], j + 1);         }       }       for (int j = big[i] - 1; j < 7; j++) c[j]++;     }     for (int j = 0; j < 7; j++)       if (c[j] >= k) {         int sz = 0;         for (int i = 2 * k * k; i >= 0; i--)           if (big[i] != 0 && big[i] - 1 <= j &&               big[i / pr[big[i] - 1]] - 1 < big[i] - 1) {             ans[sz++] = i;             if (sz == k) break;           }         if (sz < k) continue;         for (int i = sz - 1; i >= 0; i--) printf( %d  , ans[i]);         printf(  n );         return 0;       }   }   