#include <bits/stdc++.h>
using namespace std;
long long min(long long a, long long b) {
  if (a < b) return a;
  return b;
};
long long max(long long a, long long b) {
  if (a > b) return a;
  return b;
};
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); };
int main() {
  bitset<10000007> primes;
  primes.set();
  int n;
  primes[0] = primes[1] = 0;
  scanf("%d", &n);
  for (int i = 2; n; i++) {
    if (primes[i]) {
      printf("%d ", i);
      for (int j = i; j < 10000001; j += i) primes[j] = 0;
      n--;
    }
  }
  printf("\n");
}
