#include <bits/stdc++.h>
using namespace std;
vector<int> primes;
void gen_prime(int n) {
  vector<bool> isPrime(10000001, true);
  isPrime[0] = isPrime[1] = false;
  for (int i = 2; i <= 10000000; i++) {
    if (isPrime[i]) {
      primes.push_back(i);
      for (int j = i; j <= 10000000; j += i) isPrime[j] = false;
    }
  }
  int sz = (int)primes.size();
  for (int i = 0; i < n; i++) {
    cout << primes[i];
    if (i < n - 1)
      cout << " ";
    else
      cout << "\n";
  }
  return;
}
int main() {
  int n;
  cin >> n;
  gen_prime(n);
  return 0;
}
