#include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool is_prime(int n) {
  for (int i = 2; i * i <= n; ++i)
    if (n % i == 0) return false;
  return true;
}
void solve() {
  int n;
  cin >> n;
  for (int i = 2, k = 0; k < n; ++i) {
    if (is_prime(i)) {
      cout << i << ' ';
      ++k;
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  int t;
  t = 1;
  while (t-- > 0) solve();
  return 0;
}
