#include <bits/stdc++.h>
using namespace std;
int n, i;
vector<int> p;
bool IsPrime(int x) {
  int root = sqrt(x), i;
  for (i = 2; i <= root; i++)
    if (x % i == 0) return false;
  return true;
}
int main() {
  scanf("%d", &n);
  p.push_back(2);
  i = 3;
  while (p.size() < n) {
    if (IsPrime(i)) p.push_back(i);
    if (i % 6 == 1) i += 2;
    i += 2;
  }
  for (auto i : p) cout << i << " ";
}
