#include <bits/stdc++.h>
using namespace std;
const int M = 1e9 + 7;
long long mod(long long x) { return ((x % M + M) % M); }
long long add(long long a, long long b) { return mod(mod(a) + mod(b)); }
long long mul(long long a, long long b) { return mod(mod(a) * mod(b)); }
long long modPow(long long a, long long b) {
  if (b == 0) return 1LL;
  if (b == 1) return a % M;
  long long res = 1;
  while (b) {
    if (b % 2 == 1) res = mul(res, a);
    a = mul(a, a);
    b = b / 2;
  }
  return res;
}
int prime[10000010], vis[10000010], num;
void seive_primes() {
  memset(vis, 1, sizeof(vis));
  num = 0;
  for (int i = 2; i < 10000000; i++) {
    if (vis[i]) {
      prime[num++] = i;
      for (int j = 2; j * i < 10000000; j++) vis[j * i] = 0;
    }
  }
}
void solve() {
  int n;
  cin >> n;
  int q = 0;
  seive_primes();
  while (n--) {
    cout << prime[q++] << " ";
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout << fixed;
  cout << setprecision(10);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
