#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC push_options
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include<bits/stdc++.h>
#include <xmmintrin.h>
#include <immintrin.h>
using namespace::std;
__attribute__((constructor))void init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include<ext/pb_ds/tag_and_trait.hpp>
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// typedef mp::number<mp::cpp_dec_float<0>> cdouble;
// typedef mp::cpp_int cint;
template<typename T>using pbds=__gnu_pbds::tree<T,__gnu_pbds::null_type,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T>using pbds_map=__gnu_pbds::tree<T,T,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T,typename E>using hash_map=__gnu_pbds::gp_hash_table<T,E>;
template<typename T>using pqueue =__gnu_pbds::priority_queue<T, greater<T>,__gnu_pbds::rc_binomial_heap_tag>;
typedef long long lint;
#define INF (1LL<<60)
#define IINF (1<<30)
#define EPS (1e-10)
#define endl ('\n')
//#define MOD 1000000007LL
#define MOD 998244353LL
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
template<typename T>inline void numout(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i<INF/2?i:"INF";f=1;}cout<<endl;}
template<typename T>inline void numout2(T t){for(auto i:t)numout(i);}
template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}
template<typename T>inline void output2(T t){for(auto i:t)output(i);}
template<typename T>inline void _output(T t){bool f=0;for(lint i=0;i<t.size();i++){cout<<f?"":" "<<t[i];f=1;}cout<<endl;}
template<typename T>inline void _output2(T t){for(lint i=0;i<t.size();i++)output(t[i]);}
#define rep(i,n) for(lint i=0;i<lint(n);++i)
#define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)
#define rrep(i,n) for(lint i=lint(n)-1;i>=0;--i)
#define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)
#define irep(i) for(lint i=0;;++i)
#define all(n) begin(n),end(n)
#define dist(a,b,c,d) sqrt(pow(a-c,2)+pow(b-d,2))
//inline lint gcd(lint A,lint B){return B?gcd(B,A%B):A;}
//inline lint lcm(lint A,lint B){return A/gcd(A,B)*B;}
// inline cint cgcd(cint A,cint B){return B?cgcd(B,A%B):A;}
// inline cint clcm(cint A,cint B){return A/cgcd(A,B)*B;}
bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}
bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}
const vector<lint> dx={1,0,-1,0,1,1,-1,-1};
const vector<lint> dy={0,1,0,-1,1,-1,1,-1};
#define SUM(v) accumulate(all(v),0LL)
auto call=[](auto f,auto... args){return f(f,args...);};

template<typename T>
class segment{
	T* node;
	int n=1;
	public:
	segment(int sz){
		while(n<=sz)n<<=1;
		node=new T[(n<<1)-1];
		for(int i=0;i<(n<<1)-1;i++)node[i]=e;
	}
	segment(const vector<T>& v){
		while(n<(int)v.size())n<<=1;
		node=new T[(n<<1)-1];
		for(int i=0;i<(int)v.size();i++)node[i+n-1]=v[i];
		for(int i=n-2;i>=0;i--)node[i]=f(node[(i<<1)+1],node[(i<<1)+2]);
	}
	T get(auto l,auto r){
		l+=n;r+=n;
		T s=e,t=e;
		while(l<r){
			if(l&1)s=f(s,node[l++-1]);
			if(r&1)t=f(node[--r-1],t);
			l>>=1;r>>=1;
		}
		return f(s,t);
	}
    void change(auto t,T val){
		t+=n-1;
        node[t]=val;
		while(t){
			t=(t-1)>>1;
            node[t]=f(node[t*2+1],node[t*2+2]);
		}
	}
	void update(auto t,T val){
		t+=n-1;
        node[t]=f(node[t],val);
		while(t){
			t=(t-1)>>1;
            node[t]=f(node[t*2+1],node[t*2+2]);
		}
	}
	T e=INF;
	T f(const T& s,const T& t){
		return min(s,t);
	}
};

lint bs(lint mn,lint mx,auto func){
    mn--;
    mx++;
	while(mx-mn>1){
		lint mid=(mn+mx)/2;
		if(!func(mid))mx=mid;
		else mn=mid;
	}
    return mn;
}

int main(){
    lint n;
    cin>>n;
    vec a;
    lint cnt=0,su=0;
    if(n==3){
        cout<<"2 5 63"<<endl;
        return 0;
    }
    if(n==4){
        cout<<"2 3 4 9"<<endl;
        return 0;
    }
    if(20000-100<=n){
        set<lint>s;
        rep(i,30000/6){
            s.emplace(i*6+2);
            s.emplace(i*6+3);
            s.emplace(i*6+4);
            s.emplace(i*6+6);
        }
        lint t=s.size()-n;
        rep(i,t)s.erase(i*6+6);
        output(s);
        return 0;
    }
    while(1){
        if(cnt){
            a.push_back(cnt*6);
            su+=cnt*6;
        }
        if(a.size()==n-2)break;
        a.push_back(cnt*6+2);
        su+=cnt*6+2;
        if(a.size()==n-2)break;
        a.push_back(cnt*6+4);
        su+=cnt*6+4;
        if(a.size()==n-2)break;
        a.push_back(cnt*6+3);
        su+=cnt*6+3;
        if(a.size()==n-2)break;
        cnt++;
    }
    if(su%6==2){
        a.push_back(cnt*6+4);
        a.push_back((cnt+1)*6);
    }
    if(su%6==0){
        a.push_back((cnt+1)*6);
         a.push_back((cnt+2)*6);
    }
    if(su%6==3){
        a.push_back((cnt+1)*6+3);
        a.push_back((cnt+1)*6);
    }
    if(su%6==5){
        a.push_back((cnt+1)*6+4);
        a.push_back((cnt+1)*6+3);
    }
    output(a);
}


Measured memory_bytes: 2304