#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")

using ll = long long;
constexpr int INF = 1001001001;
// constexpr int mod = 1000000007;
constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N;
    cin >> N;

    if(N == 3)  return puts("-1") & 0;
    if(N <= 2)  return puts("1") & 0;
    if(N == 4)  return puts("2 4") & 0;
    if(N <= 6)  return puts("2 6 3") & 0;

    int L = (N + 1) / 2 - 4;
    deque<int> deq;
    deq.emplace_back(2);
    deq.emplace_back(4);
    deq.emplace_back(6);
    deq.emplace_back(3);
    int x = 8;
    while(L-- > 0){
        deq.emplace_front(x);
        x += 2;
    }
    
    int M = (N + 1) / 2;
    for(int i = 0; i < M; ++i){
        cout << deq[i] << (i == M - 1 ? '\n' : ' ');
    }

    return 0;
}