#include <bits/stdc++.h>
using namespace std;
const long long modulo = 1e10 + 7;
const long long N = 1e9;
const long long MAX = 1e18;
const long long val = 1e7;
bool prime[val + 1];
void arrayinput(long long s[], long long size) {
  for (long long i = 0; i < size; i++) cin >> s[i];
  return;
}
void printarray(long long s[], long long size) {
  for (long long i = 0; i < size; i++) cout << s[i] << " ";
  return;
}
void Sieve() {
  memset(prime, true, sizeof(prime));
  for (int p = 2; p * p <= val; p++) {
    if (prime[p] == true) {
      for (int i = p * p; i <= val; i += p) prime[i] = false;
    }
  }
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long test;
  test = 1;
  while (test--) {
    Sieve();
    long long n;
    cin >> n;
    for (long long i = 2; i < val && n > 0; i++) {
      if (prime[i] == true) {
        cout << i << " ";
        n--;
      }
    }
  }
}
