#include <bits/stdc++.h>
using namespace std;
const int MAX = 10000001;
bool prime[MAX];
int primeCount = 0;
void buildSimple() {
  for (int i = 0; i < MAX; i++) {
    prime[i] = true;
  }
  prime[0] = prime[1] = false;
  for (int i = 2; i < MAX; i++) {
    if (!prime[i]) {
      continue;
    }
    primeCount++;
    for (int j = 2; j < MAX / i + 1; j++) {
      if (i * j < MAX) {
        prime[i * j] = false;
      }
    }
  }
}
int main() {
  int n;
  buildSimple();
  while (cin >> n) {
    for (int i = 0; n > 0; i++) {
      if (prime[i]) {
        cout << i << ' ';
        n--;
      }
    }
    cout << endl;
  }
  return 0;
}
