#include <bits/stdc++.h>
using namespace std;
const int si = 1e5 + 7;
const int mod = 1e9 + 7;
long long int fexpo(long long int a, long long int b) {
  if (b == 0) return 1LL;
  if (b == 1) return a;
  if (b == 2) return a * a;
  if (b % 2 == 0)
    return fexpo(fexpo(a, b / 2), 2);
  else
    return a * fexpo(fexpo(a, (b - 1) / 2), 2);
}
vector<bool> primes(10101011, false);
int nprime[10101010];
int k = 0;
void seive() {
  memset(nprime, 0, sizeof nprime);
  int n = 10000001;
  primes[0] = true;
  primes[1] = true;
  for (int i = 2; i <= 10000010; i++) {
    if (primes[i] == false) {
      primes[i] = false;
      nprime[k++] = i;
      for (int j = i + i; j < 10001000; j += i) primes[j] = true;
    }
  }
}
void solve() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  seive();
  int n;
  cin >> n;
  int ct = 0;
  for (int i = 0; i < n; i++) cout << nprime[i] << endl;
}
int main() {
  solve();
  return 0;
}
