#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include 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 inline bool chmax(T& x, T y){ if(x < y){ x = y; return true; } return false; } template 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 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; }