#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_set>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2(i, 0, n)
#define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using i64 = long long;
template<class T, class U>
bool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; }
template<class T, class U>
bool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; }

template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}
template<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}
template<typename T>string join(vector<vector<T>>&vv){string s="\n";rep(i,vv.size())s+=join(vv[i])+"\n";return s;}
template<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}

int main()
{
    int n;
    cin >> n;
    vector<int> ans;
    if (n <= 2) cout << 1 << endl;
    else if (n % 2 == 0){
        rep(i, 1, n + 1) if (i % 2 == 0) ans.emplace_back(i);
        cout << ans << endl;
    }
    else{
        if (n <= 5) cout << -1 << endl;
        else if (n == 7) ans = {3, 6, 2, 4};
        else{
            int x = n / 3;
            x *= 3;
            if (x % 2 == 0) x -= 3;
            for (int i = x; i >= 3; i -= 6){
                ans.emplace_back(i);
            }
            ans.emplace_back(6);
            for (int i = 2; i <= n; i += 2){
                if (i == 6) continue;
                ans.emplace_back(i);
                if (ans.size() == (n + 1) / 2) break;
            }
        }
        cout << ans << endl;
    }
}