#include <bits/stdc++.h>
using namespace std;
int n, i;
vector<bool> isPrime(1500001, true);
void sieve(int n) {
  isPrime[0] = isPrime[1] = 0;
  for (long long i = 2; i * i <= n; ++i) {
    if (isPrime[i]) {
      for (int j = i * 2; j <= n; j += i) isPrime[j] = 0;
    }
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  scanf("%d", &n);
  sieve(1500000);
  while (n > 0) {
    if (isPrime[i]) {
      printf("%d ", i);
      n--;
    }
    i++;
  }
  return 0;
}
