#include <bits/stdc++.h>
using namespace std;
int main() {
  vector<int> nums;
  int primes[15] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41};
  int used[15];
  int n, i, j, temp, maxnum;
  memset(used, 0, sizeof(used));
  scanf("%d", &n);
  maxnum = 2 * n * n;
  for (i = 0; nums.size() < n; i++) {
    nums.push_back(primes[i]);
    for (j = 0; j < nums.size(); j++) {
      temp = nums[j] * primes[i];
      if (temp <= maxnum) {
        nums.push_back(temp);
        used[i]++;
      }
    }
    for (j = 0; j < i; j++) {
      used[j] += used[i];
    }
  }
  sort(nums.begin(), nums.end());
  for (i = nums.size() - n; i < nums.size(); i++) {
    printf("%d ", nums[i]);
  }
  return 0;
}
