#include <bits/stdc++.h>
const int NS = 10000000;
int prime[NS], isprime[NS], top;
int n, t, s, k;
int a[110];
void prepare() {
  top = 1, prime[0] = 2;
  for (int i = 3; i < NS; i += 2) {
    if (isprime[i] == 0) {
      prime[top++] = i;
      if (top > n) break;
      if (i < 4000)
        for (int j = i * i; j < NS; j += i + i) isprime[j] = 1;
    }
  }
}
int main() {
  while (~scanf("%d", &n)) {
    prepare();
    for (int i = 0; i < n; i++) printf("%d ", prime[i]);
    puts("");
  }
  return 0;
}
