#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
  int v;
  istringstream sin(s);
  sin >> v;
  return v;
}
template <class T>
inline string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}
template <class T>
inline T sqr(T x) {
  return x * x;
}
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, 1, -1};
int k;
vector<int> prime;
bool not_prime[10000001];
void sieve(int n) {
  not_prime[0] = not_prime[1] = true;
  for (int i = 2; i <= n; i++) {
    if (!not_prime[i]) {
      prime.push_back(i);
      for (int j = 2 * i; j <= n; j += i) not_prime[j] = true;
    }
  }
}
int main() {
  sieve(10000000);
  cin >> k;
  for (int i = (0); i < (k); ++i)
    printf("%d%c", prime[i], i != k - 1 ? ' ' : '\n');
  return 0;
}
