#include <bits/stdc++.h>
using namespace std;
long long su[10000000], cnt;
bool isprime[10000000];
void prime() {
  cnt = 1;
  memset(isprime, 1, sizeof(isprime));
  isprime[0] = isprime[1] = 0;
  for (long long i = 2; i <= 10000000; i++) {
    if (isprime[i]) su[cnt++] = i;
    for (long long j = 1; j < cnt && su[j] * i < 10000000; j++) {
      isprime[su[j] * i] = 0;
    }
  }
}
int main() {
  int n;
  prime();
  cin >> n;
  for (int i = 1; i <= n; i++) {
    printf("%d", su[i]);
    printf("%c", i == n ? '\n' : ' ');
  }
  return 0;
}
