// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL<<(n))
#define F first
#define S second
// functions
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());}
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20);}
} fast_io_;

template<typename T>
T tgcd(T a, T b) {
  if(a > b)return tgcd(b, a);
  if(a == 0)return b;
  return tgcd(b % a, a);
}

vector<int> solve(int n){
  if(n == 3){
    return vector<int>{2, 5, 63};
  }
  int k = (n - 1) / 4;
  vector<int> res;
  rep(i, k){
    res.pb(6 * i + 2);
    res.pb(6 * i + 3);
    res.pb(6 * i + 4);
    res.pb(6 * i + 6);
  }
  if(n % 4 == 0){
    res.pb(6 * k + 2);
    res.pb(6 * k + 3);
    res.pb(6 * k + 4);
    res.pb(6 * k + 6);
    if((n / 4) % 2 == 1)res.back() = 6 * k + 9;
  }else if(n % 4 == 1){
    if(k % 2 == 1)res.pb(6 * k + 3);
    else res.pb(6 * k + 6);
  }else if(n % 4 == 2){
    if(k % 2 == 1){
      res.pb(6 * k + 3);
      res.pb(6 * k + 6);
    }else{

      res.pb(6 * k + 2);
      res.pb(6 * k + 4);
    }
  }else{
    if(k % 2 == 1){
      res.pb(6 * k + 2);
      res.pb(6 * k + 3);
      res.pb(6 * k + 4);
    }else{
      res.pb(6 * k + 2);
      res.pb(6 * k + 4);
      res.pb(6 * k + 6);
    }
  }
  
  return res;
}

int main(int argc, char const* argv[])
{
  /*for(int i = 3; i <= 2000; i++){
    int g = 0;
    auto v = solve(i);
    //cerr << i << ": " << v << endl;
    for(auto c: v)g = tgcd(g, c);
    assert(g == 1);
    ll sum = 0;
    for(auto c: v)sum += c;
    for(auto c: v)assert(tgcd(sum - c, (ll)c) != 1LL);
  }*/
  int n; cin >> n;
  auto res = solve(n);
  cout << res << endl;
  return 0;
}


Measured memory_bytes: 640