#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
int max(int a, int b) {
  if (a > b)
    return a;
  else
    return b;
}
int min(int a, int b) {
  if (a < b)
    return a;
  else
    return b;
}
bool isPrime(int N) {
  for (int i = 2; i * i <= N; ++i) {
    if (N % i == 0) return false;
  }
  return true;
}
vector<int> primes;
bool arr[90000001];
void sieve() {
  int max = 10000000;
  arr[0] = arr[1] = true;
  for (int i = 2; i * i < max; i++) {
    if (arr[i] == false) {
      for (int j = i * i; j <= max; j += i) {
        arr[j] = true;
      }
    }
  }
  for (int i = 2; i <= max; i++) {
    if (!arr[i]) {
      primes.push_back(i);
    }
  }
}
void solve() {
  int n;
  cin >> n;
  for (int(i) = 0; (i) < (n); (i)++) cout << primes[i] << " ";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  sieve();
  while (t--) {
    solve();
  }
  return 0;
}
