#include <bits/stdc++.h>
using namespace std;
vector<int> gen_primes(int N) {
  int count = 0;
  vector<int> primes;
  int n = 1;
  while (primes.size() < N) {
    n++;
    if (n == 2) {
      primes.push_back(2);
      continue;
    }
    if (n % 2 == 0) continue;
    bool passes = true;
    for (auto i : primes) {
      if (n % i == 0) {
        passes = false;
        break;
      }
      if (i * i > n) break;
    }
    if (passes) {
      primes.push_back(n);
    }
  }
  return primes;
}
int main() {
  int n;
  cin >> n;
  for (auto a : gen_primes(n)) {
    cout << a << " ";
  }
  cout << "\n";
  return 0;
}
