#include <bits/stdc++.h>
using namespace std;
bool is_prime(int a) {
  int i = 2;
  for (; i * i <= a; i++) {
    if (a % i == 0) return 0;
  }
  return 1;
}
int main() {
  int n;
  scanf("%d", &n);
  int a[n + 1];
  int index = 0;
  int pre = 2;
  while (index < n) {
    if (is_prime(pre)) {
      a[index] = pre;
      index++;
    }
    pre++;
  }
  for (int i = 0; i < n; i++) cout << a[i] << " ";
  return 0;
}
