#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e7 + 7;
vector<long long> prime;
bool is_prime[MAX];
void compute_prime() {
  for (int i = 2; i < MAX; i++) {
    is_prime[i] = 1;
  }
  for (int i = 2; (i * i < MAX); i++) {
    if (is_prime[i]) {
      for (int j = i * i; j < MAX; j += i) is_prime[j] = 0;
    }
  }
  for (int i = 0; i < MAX; i++)
    if (is_prime[i]) prime.push_back(i);
}
int main() {
  compute_prime();
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) cout << prime[i] << " ";
}
