#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1e18;
const int INF = 1001001001;
#define dame { puts("-1"); return 0;}
#define yn {puts("YES");}else{puts("NO");}
const int MX = 30000;
#include <random>
random_device _rd;
mt19937 _mt(_rd()+time(0));
inline int rnd(int n) { return _mt()%n;}
inline int rnd(int l, int r) { return _mt()%(r-l+1)+l;}



int main() {
  int n;
  scanf("%d",&n);
  if (n == 3) {
    cout<<2<<" "<<5<<" "<<63<<endl;
    return 0;
  }
  vi a = {2,3,4,9};
  n -= 4;
  int i = 21;
  while (n >= 2 && i <= MX) {
    a.pb(i-6);
    a.pb(i);
    i += 12;
    n -= 2;
  }
  i = 14;
  while (n >= 3 && i <= MX) {
    a.pb(i-4);
    a.pb(i-2);
    a.pb(i);
    i += 6;
    n -= 3;
  }
  while (n >= 2 && i <= MX) {
    a.pb(i-4);
    a.pb(i);
    n -= 2;
  }
  if (n) a.pb(i-2), --n;
  if (n == 1) {
    a.pb(6);
  } else if (n == 2) {
    a.pb(1261);
    a.pb(13217);
  // } else {
  } else if (n == 3) {
    // a.pb(6); --n;
    a.pb(8); --n;
    a.pb(197);
    a.pb(15863);
    // ll x = suma(a);
    // while (1) {
    //   vi s(n);
    //   rep(i,n) s[i] = rnd(1,MX/2-1)*2+1;
    //   bool ok = true;
    //   rep(i,n) if (s[i]%3 == 0) ok = false;
    //   if (!ok) continue;
    //   sort(rng(s));
    //   uni(s);
    //   if (sz(s) != n) continue;
    //   ll y = x+suma(s);
    //   rep(i,n) if (y%s[i]) ok = false;
    //   if (y%6) continue;
    //   if (!ok) continue;
    //   a.insert(a.end(),rng(s));
    //   break;
    // }
  }
  cout<<a<<endl;
  return 0;
}






















Measured memory_bytes: 768