#include <bits/stdc++.h>
using namespace std;
const int inf = 0x7FFFFFFF;
template <class T>
T gcd(T a, T b) {
  if (a % b) return gcd(b, a % b);
  return b;
}
template <class T>
T lcm(T a, T b) {
  return a * b / gcd(a, b);
}
template <class T>
T big_mod(T n, T p, T m) {
  if (p == 0) return 1;
  T x = big_mod(n, p / 2, m);
  x = (x * x) % m;
  if (p & 1) x = (x * n) % m;
  return x;
}
template <class T>
inline T Mod(T n, T m) {
  return (n % m + m) % m;
}
template <class T>
T MIN(T a, T b, T c) {
  return min(a, min(b, c));
}
template <class T>
T MAX(T a, T b, T c) {
  return max(a, max(b, c));
}
const int Max = 10000000;
bool prime_check[Max];
vector<int> prime;
void sieve() {
  int i, j;
  int sq = sqrt(Max);
  for (i = 2; i * i <= Max; i++) {
    if (!prime_check[i]) {
      prime.push_back(i);
      for (j = i * i; j < Max; j += i) {
        prime_check[j] = true;
      }
    }
  }
  for (i = sq + 1; i <= Max; i++) {
    if (!prime_check[i]) prime.push_back(i);
  }
}
int main() {
  int n;
  sieve();
  cin >> n;
  for (int i = 0; i < n; i++) {
    printf("%d ", prime[i]);
  }
  printf("\n");
  return 0;
}
