#include <bits/stdc++.h>
using namespace std;
const int maxn = 5000001;
int notP[maxn], P[maxn], Pt;
void sieve(int n) {
  notP[1] = 1;
  for (int i = 2; i <= n; ++i) {
    if (!notP[i]) P[++Pt] = i;
    for (int j = 1; j <= Pt && P[j] * i <= n; ++j) {
      notP[P[j] * i] = 1;
      if (i % P[j] == 0) break;
    }
  }
}
int main() {
  int n;
  scanf("%d", &n);
  sieve(maxn - 1);
  for (int i = 1; i <= n; ++i) {
    printf("%d%c", P[i], i == n ? '\n' : ' ');
  }
  return 0;
}
