#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;

bool is_prime(ll x){
    for(int i = 2; i*i <= x; i++){
        if(x%i == 0) return false;
    }
    return true;
}

int main()
{
    int n;
    cin >> n;
    if(is_prime(100001)) cout << 2 << endl;
    if(n == 1){
        cout << 1 << endl;
        return 0;
    }
    if(n == 2){
        cout << 100001 << endl;
        return 0;
    }
    if(n == 3){
        cout << 100027 << endl;
        return 0;
    }
    vector<ll> a;
    a.push_back(1);
    ll m = 100000;
    rep(i, 0, n-1){
        rep(j, 2, 100001){
            if(m%j == 0) m++;
        }
        if(is_prime(m)){
            m++;
        }
        else
            cout << m << endl;
    }
    return 0;
}