#include <bits/stdc++.h>
using namespace std;
void dfs(vector<long long> v[], long long visited[], long long s) {
  visited[s] = 1;
  cout << s << " ";
  for (long long i = 0; i < v[s].size(); i++) {
    if (visited[v[s][i]] == 0) {
      dfs(v, visited, v[s][i]);
    }
  }
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long n = 10000000;
  long long c;
  cin >> c;
  vector<bool> arr(n + 1, true);
  for (long long i = 2; i * i <= n; i++) {
    if (arr[i] == true) {
      for (long long j = i * i; j <= n; j = j + i) arr[j] = false;
    }
  }
  long long count = 0;
  for (long long i = 2; i < n; i++) {
    if (arr[i] == true) {
      cout << i << " ";
      count++;
    }
    if (count == c) return 0;
  }
}
