#include<bits/stdc++.h>
#define ll long long int
#define mp make_pair
#define pii pair<int,int>
#define pll pair<long long int,long long int>
#define mii map<int,int>
#define mll map<long long int,long long int>
#define rep(it,m) for(auto it=m.begin();it!=m.end();it++)
#define pb push_back
#define fr first
#define sc second
#define mod 1000000007LL
#define setbiti(x) __builtin_popcount(x)
#define setbitll(x) __builtin_popcountll(x)
#define vi vector<int>
#define vll vector<long long int>
#define f(i,x,n) for(int i=x;i<n;i++)
#define l(i,a,b) for(int i=a;i>b;i--)
#define w(x) int x; cin>>x; while(x--)
#define all(x) x.begin(),x.end()
#define fill(a,x)  memset(a,x,sizeof(a))
#define pie 3.14159265
using namespace std;

void fio() {
/*#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif*/
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}


int main() {
    fio();
    /*int prime[10005]{0};
    prime[0]=prime[1]=1;
    for(int i=2;i*i<10005;i++){
        if(prime[i]==0){
            for(int j=i*i;j<10005;j+=i){
                prime[j]=1;
            }
        }
    }
    int cnt=0;
    for(int i=2;i<10001;i++){
        if(prime[i]==0)cnt++;
    }*/
    int n;
    cin>>n;
    ll ans[n]{0};
    f(i,0,n){
        if(i==0){
            ans[i]=10;
        }else if(i==n-1){
            ans[i]=15;
        }else{
            ans[i]=6;
        }
    }
    int j=1,id=-1;
    f(i,1,n-1){
        ans[i]=ans[i]*j;
        j++;
        if(ans[i]>10000){
            id=i;
            break;
        }
    }
    if(id!=-1){
        j=2;
        int v=-1;
        for(int i=id;i<n-1;i++){
            ans[i]=10;
            while((ans[i]*j)%6==0){
                j++;
            }
            ans[i]=ans[i]*j;
            if(ans[i]>10000){
                v=i;
                break;
            }
            j++;
        }
        if(v!=-1){
            j=2;
            f(i,v,n-1){
                ans[i]=15;
                while((ans[i]*j)%6==0 || (ans[i]*j)%10==0){
                    j++;
                }
                ans[i]=ans[i]*j;
                j++;
            }
        }
    }
    f(i,0,n){
        cout<<ans[i]<<" ";
    }
    cout<<endl;
    return 0;
}
#include <bits/stdc++.h>

int main() {
	using namespace std;
	ios_base::sync_with_stdio(false), cin.tie(nullptr);

	int N; cin >> N;
	cout << 105 << ' ';
	N--;
	for (int v = 2; N > 0; v += 2) {
		if (v % 3 == 0 || v % 5 == 0 || v % 7 == 0) {
			cout << v << " \n"[--N == 0];
		}
	}

	return 0;
}

// We'll 15, and anything that's even and a multiple of 3 or 5
// 7 / 15
