#include <bits/stdc++.h>
using namespace std;
const int N = 10000001;
bool prime[N];
void sieve() {
  memset(prime, -1, N * sizeof(prime[0]));
  prime[0] = prime[1] = false;
  int sqrtN = (int)sqrt((double)N);
  for (int i = 2; i <= sqrtN; i++)
    if (prime[i])
      for (int j = i * i; j < N; j += i) prime[j] = false;
}
int main() {
  sieve();
  int n;
  scanf("%d", &n);
  for (int i = 0; i < N && n; ++i) {
    if (prime[i]) printf("%d ", i), --n;
  }
  return 0;
}
