#include <bits/stdc++.h>
#define int ll
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _48SMghu ios::sync_with_stdio(0),cin.tie(0)
using ll=long long;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}

const int lim=1e8;

bool isprime(int n){
	for(int i=2;i<=sqrt(n);i++){
		if(n%i==0){
			return 0;
		}
	}
	return 1;
}

void slv(){
	int n=25;
	vi pris;
	for(int x=3;;x++){
		if(sz(pris)==n-1) break;
		if(isprime(x)){
			pris.pb(x);
		}
	}
	pris.insert(pris.begin(),1);
	reverse(pris.begin(), pris.end());
	vi a(n);
	rep(i,n){
		a[i]=pris[i]*(!i?1:pris[i-1]);
	}
	rng(i,1,n){
		int x=a[i-1],y=a[i];
		int p=i%2?3:2;
		while(x>=y){
			y*=p;
		}
		if(y>lim){
			break;
		}
		a[i]=y;
	}
	a[n-2]=a[n-3]+2;
	a[n-1]=a[n-2]+1;
	int l;
	cin>>l;
	rep(i,l){
		cout<<a[i]<<" ";
	}
	cout<<"\n";
}

signed main(){
_48SMghu;
	slv();
}