#include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
typedef long long ll;
typedef long double ld;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define REP(i,L,R) for(int i=L;i<R;i++)
using namespace std;
typedef vector<vector<int>> Graph;

//main area
int main(){
    int N;
    cin >> N;
    vector<int> A(N);
    A[0] = 105;
    int k = 1;
    rep1(i,10000){
        if(i%3==0 || i%5==0 || i%7==0){
            A[k] = 2*i;
            k++;
            if(k==N) break;
        }
    }
  	// cout << A[N-1] << endl;
    rep(i,N){
        cout << A[i] << (i==N-1?'\n':' ');
    }
}
/*



*/
#include <iostream>
#include <iomanip>
#include <fstream>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <algorithm>
#include <numeric>
#include <utility>
#include <random>
#include <chrono>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>

using namespace std;

using LL = long long;
using ULL = unsigned long long;
using PII = pair<int, int>;
using PIL = pair<int, LL>;
using PLL = pair<LL, LL>;
// constexpr int mod = 1e9 + 7;
// constexpr int mod = 998244353;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

int n;

inline void work() {
    cin >> n;
    cout << "6 10 15";
    int p = 16;
    for (int i = 4; i <= n; ++i) {
        while (p % 6 != 0 && p % 10 != 0 && p % 15 != 0) {
            ++p;
        }
        cout << " " << p;
        ++p;
    }
    cout << "\n";
}

int main() {
    // freopen("input.txt", "r", stdin);
    quickread();
    work();
    return 0;
}