#include <bits/stdc++.h>
unsigned base[1299715], primes[100099];
int total;
void sieve() {
  unsigned i, j, k;
  for (i = 3; i < 1141; i += 2)
    if (!base[i])
      for (j = i * i, k = i << 1; j < 1299715; j += k) base[j] = 1;
  primes[1] = 2;
  for (i = 3, j = 2; i < 1299715; i += 2)
    if (!base[i]) primes[j++] = i;
  total = j;
}
int main() {
  sieve();
  int n, i;
  scanf("%d", &n);
  for (i = 1; i < total && i <= n; i++) {
    printf("%d%s", primes[i], (i == n ? "" : " "));
  }
  return 0;
}
