#include <bits/stdc++.h>
using namespace std;
vector<long long> isprime((long long)(1e7 + 15), true);
vector<long long> prime;
vector<long long> SPF((long long)(1e7 + 15));
void f() {
  isprime[0] = isprime[1] = false;
  for (long long i = 2; i < (long long)(1e7 + 15); i++) {
    if (isprime[i]) {
      prime.push_back(i);
      SPF[i] = i;
    }
    for (long long j = 0;
         j < prime.size() && i * prime[j] < (long long)(1e7 + 15) &&
         prime[j] <= SPF[i];
         j++) {
      isprime[i * prime[j]] = false;
      SPF[i * prime[j]] = prime[j];
    }
  }
}
int main() {
  f();
  int n;
  cin >> n;
  for (int i = 0; i < n && prime[i] <= (int)1e7; i++) cout << prime[i] << " ";
  return 0;
}
