#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
const int N = 500010;
const int M = 1e9 + 0.5;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int pi = cos(-1.0);
const long long oo = 0x3f3f3f3f3f3f3f3fll;
int k;
int p[11] = {2, 3, 5, 7, 11, 13, 17, 19};
vector<int> ans;
int main() {
  scanf("%d", &k);
  for (int i = 0; ans.size() < k; i++) {
    ans.push_back(p[i]);
    int t = ans.size();
    for (int j = 0; j < ans.size(); j++) {
      int tmp = ans[j] * p[i];
      if (tmp <= 2 * k * k) {
        ans.push_back(tmp);
      }
    }
  }
  sort(ans.begin(), ans.end());
  for (int i = ans.size() - k; i < ans.size(); i++) cout << ans[i] << " ";
  cout << endl;
  return 0;
}
