#include <bits/stdc++.h>
using namespace std;
bool isPrime[10000007];
const int LIMIT = 10000000;
int main() {
  ios_base::sync_with_stdio(0);
  memset(isPrime, 1, sizeof(isPrime));
  isPrime[0] = 0;
  isPrime[1] = 0;
  int n;
  cin >> n;
  vector<int> primes;
  for (int i = 2; (i * i) <= LIMIT; i++) {
    if (isPrime[i]) {
      for (int j = i * i; j <= LIMIT; j += i) isPrime[j] = 0;
    }
  }
  for (int i = 0; i < 10000007; i++) {
    if (isPrime[i]) {
      primes.push_back(i);
    }
  }
  int counter = 0;
  for (int i = 0; i < primes.size(); i++) {
    for (int j = i; j < primes.size(); j++) {
      if ((long long)primes[i] * (long long)primes[j] <= LIMIT) {
        cout << (long long)primes[i] * (long long)primes[j] << " ";
        counter++;
        if (counter == n) {
          return 0;
        }
      }
    }
  }
  return 0;
}
