#include <bits/stdc++.h>
const long long nax = 10000001;
using namespace std;
vector<bool> s;
vector<long long> primes;
void seive() {
  for (long long i = 0; i < nax; i++) s.push_back(1);
  for (long long i = 3; i * i <= nax; i++) {
    if (s[i]) {
      for (long long j = 2; j * i <= nax; j++) s[i * j] = 0;
    }
  }
}
void prime() {
  primes.push_back(2);
  for (long long i = 3; i < nax; i += 2) {
    if (i % 2 == 0) continue;
    if (s[i]) primes.push_back(i);
  }
}
int main() {
  seive();
  prime();
  long long n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    printf("%lld ", primes[i]);
  }
}
