#include "bits/stdc++.h"
#include <chrono>
#include <random>
#define lli long long int
using namespace std;
#define mod 1000000007
#define mod1 998244353
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); 
#define INF 1000000000
#define common cout << "Case #" << w+1 << ": "  
#define maxn 10010

void setIO(string name) {
	ios_base::sync_with_stdio(0); cin.tie(0);
	freopen((name+".in").c_str(),"r",stdin);
	freopen((name+".out").c_str(),"w",stdout);
}

template< typename T> 
void PVecPrint(vector<T>&v) 
{ 
    for(int i=0;i<(int)v.size();i++) 
        cout << v[i].first << "," << v[i].second << ' '; 
    cout << '\n'; 
}
template<class T> 
void VecPrint(vector<T>&v)
{
    for(int i=0;i<v.size();i++) 
        cout << v[i] << ' ';
    cout << '\n';
}
/*-------------------------------------------------------------------Code-----------------------------------------------------------------*/

int main()
{
    int n;
    cin >> n;
    n-=3;
    vector<int>v{6,10,15};
    int t=12;
    set<int>s;
    while (t<10000 and n>0)
    {
        v.push_back(t);
        s.insert(t);
        n-=1;
        t+=6;
    }
    // cout << n << ' ' << s.size() << ' ' << v.size() << '\n';
    t=20;
    while (t<10000 and n>0)
    {
        if(s.find(t)==s.end())
        {
            v.push_back(t);
            s.insert(t);
            n-=1;
        }
        t+=10;
    }
    // cout << n << ' ' << s.size() << ' ' << v.size() << '\n';
    t=30;
    while (t<10000 and n>0)
    {
        if(s.find(t)==s.end())
        {
            v.push_back(t);
            s.insert(t);
            n-=1;
        }
        t+=15;
    }
    // cout << s.size() << ' ' << v.size() << '\n';
    // cout << n << '\n';
    VecPrint<int>(v);
}
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fast_io ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define all(v) v.begin(),v.end()

const int mod = 1e9 + 7;

int main (){
    fast_io;
    int n;
    cin >> n;
    int a[n];
    for (int i = 0; i < n; i++)
        a[i] = 1;
    a[0] = 3 * 5;
    a[n - 1] = 2 * 5;
    map<int, int> freq;
    for (int i = 0; i < n; i++) {
        freq[a[i]]++;
    }
    for (int i = 0; i < n - 1; i++) {
        if (freq[a[i]] > 1 || a[i] == 1) {
            for (int j = 2; j <= 10000; j++) {
                if (j % 10 && j % 6 && j % 15)
                    continue;
                if (freq.count(j) == 0) {
                    freq[j]++;
                    freq[a[i]]--;
                    a[i] = j;
                    break;
                }
            }
        }
    }
    for (auto it: freq) {
        assert(it.second < 2);
    }
    for (int i = 0; i < n; i++)
        cout << a[i] << ' ';
    cout << endl;
}
