#include <bits/stdc++.h>
using namespace std;
int N;
int graph[360][360];
bitset<10000001> gP;
int pless[10000001];
int K;
void sieve() {
  int i, j;
  for (i = 3; i <= 3163; i += 2) {
    if (!gP[i]) {
      for (j = i * i; j < 10000000; j += (i + i)) {
        gP[j] = true;
      }
    }
  }
  gP[1] = true;
  pless[1] = 2;
  K = 2;
  for (int i = 3; i < 9999998; i += 2) {
    if (!gP[i]) pless[K++] = i;
  }
}
int ip(int n) {
  if (n == 2) return 1;
  if (n & 1) return !gP[n];
  return 0;
}
int main() {
  sieve();
  int n;
  scanf("%d", &n);
  for (int i = 2; i <= n + 1; ++i) printf("%d ", pless[i]);
  puts("");
  return 0;
}
