#include <bits/stdc++.h>
using namespace std;
using namespace std;
const int N = 10000001, M = 100000;
bool flag[N];
int prime[M];
void make() {
  int cnt = 1;
  memset(flag, 0, sizeof(flag));
  prime[0] = 2;
  for (long long i = 3; i < N && cnt < M; i += 2)
    if (!flag[i]) {
      prime[cnt++] = i;
      for (long long j = i * i; j < N; j += i) flag[j] = 1;
    }
}
int main() {
  make();
  int n;
  while (scanf("%d", &n) != EOF) {
    for (int i = 0; i < n; ++i)
      printf("%d%c", prime[i], i == n - 1 ? '\n' : ' ');
  }
}
