#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll MAXN = 5e7;
vector<bool> prime;
vector<int> primes;
void sieve() {
  ll maximum = max(MAXN, 2LL);
  prime.assign(maximum + 1, true);
  prime[0] = prime[1] = false;
  primes = {};
  for (int p = 2; p <= maximum; p++)
    if (prime[p]) {
      primes.push_back(p);
      for (int64_t i = int64_t(p) * p; i <= maximum; i += p)
        if (prime[i]) {
          prime[i] = false;
        }
    }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  sieve();
  ll n;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cout << primes[i] << " ";
  }
  cout << '\n';
}
