#include <bits/stdc++.h>
using namespace std;
vector<long long int> prime;
bool status[10000005];
void sieve();
int main() {
  sieve();
  long long int n, i, j, k;
  scanf("%lld", &n);
  for (i = 0; i < n; i++) {
    if (i == n - 1) {
      cout << prime[i];
    } else {
      cout << prime[i] << " ";
    }
  }
  printf("\n");
  return 0;
}
void sieve() {
  long long int i, j;
  status[0] = 1;
  status[1] = 1;
  status[2] = 0;
  for (i = 4; i <= 10000005; i += 2) {
    status[i] = 1;
  }
  for (i = 3; i <= sqrt(10000005); i += 2) {
    if (status[i] == 0) {
      for (j = i * i; j <= 10000005; j += i) {
        status[j] = 1;
      }
    }
  }
  for (i = 1; i <= 10000005; i++) {
    if (status[i] == 0) {
      prime.push_back(i);
    }
  }
}
