#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <unordered_map>
using namespace std;

#define REP(i, s) for (int i = 0; i < s; ++i)
#define ALL(v) (v.begin(), v.end())
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T> ostream& operator << (ostream &s, set<T> P)
{ EACH(it, P) { s << "<" << *it << "> "; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }

long long GCD(long long a, long long b) {
    if (b == 0) return a;
    else return GCD(b, a % b);
}

bool check(vector<long long> vec) {
    long long sum = 0;
    for (int i = 0; i < vec.size(); ++i) {
        if (vec[i] > 30000) return false;
        sum += vec[i];
    }
    
    for (int i = 0; i < vec.size(); ++i) {
        long long rem = sum - vec[i];
        long long d = GCD(vec[i], rem);
        if (d == 1) return false;
    }
    
    long long d = vec[0];
    for (int i = 0; i < vec.size(); ++i) {
        d = GCD(d, vec[i]);
    }
    if (d != 1) return false;
    
    set<long long> se;
    for (int i = 0; i < vec.size(); ++i) {
        if (se.count(vec[i])) return false;
        se.insert(vec[i]);
    }
    
    return true;
}

bool ok(long long n) {
    if (n % 2 == 0 || n % 3 == 0 || n % 5 == 0) return true;
    else return false;
}

int N;
int main() {
    while(cin >> N) {
        vector<long long> res;
        for (int i = 2; i <= 30000; ++i) {
            if (i % 2 == 0 || i % 3 == 0 || i % 5 == 0) res.push_back(i);
            if (res.size() == N-1) break;
        }
        long long sum = 0;
        for (int i = 0; i < res.size(); ++i) sum += res[i];
        
        while (true) {
            if (ok(sum) && ok(res.back())) break;
            ++res.back();
            ++sum;
        }
        
        long long back = res.back();
        for (long long num = back + 1; num <= 30000; ++num) {
            if ((num + sum) % 30 == 0 && (num % 2 == 0 || num % 3 == 0 || num % 5 == 0)) {
                res.push_back(num);
                break;
            }
        }
        for (int i = 0; i < res.size(); ++i) {
            cout << res[i];
            if (i != (int)res.size() - 1) cout << " ";
        }
        cout << endl;
    }
}




















    
    
    
    
    
    
    


Measured memory_bytes: 640