#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll MOD = 1e9 + 7;
//constexpr ll MOD = 998244353;
//constexpr ll MOD = ;
ll mod(ll A, ll M) {return (A % M + M) % M;}
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll divceil(ll A, ll B) {return (A + (B - 1)) / B;}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)

int main()
{
  ll N;
  cin >> N;

  if (N == 1 || N == 2)
    FINALANS(1);
  
  if (N == 3 || N == 5)
    FINALANS(-1);
  
  if (N % 2 == 0)
  {
    for (ll i = 0; i < N / 2; i++)
    {
      cout << 2 * (i + 1) << ((i == N / 2 - 1) ? '\n' : ' ');
    }
  }
  else
  {
    vector<ll> A(N / 2 + 1);
    for (ll i = 0; i < N / 2; i++)
    {
      A.at(i) = 2 * (i + 1);
    }
    swap(A.at(2), A.at(N / 2 - 1));
    A.at(N / 2) = 3;

    for (ll i = 0; i < N / 2 + 1; i++)
    {
      cout << A.at(i) << ((i == N / 2) ? '\n' : ' ');
    }
  }
}