#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#include <functional>
#include <ctime>
#pragma warning(disable:4996) 

//#define ATCODER
#ifdef ATCODER
#include <atcoder/all>
#endif

typedef long long ll;
typedef unsigned long long ull;
#define LINF  9223300000000000000
#define LINF2 1223300000000000000
#define LINF3 1000000000000
#define INF 2140000000
const long long MOD = 1000000007;
//const long long MOD = 998244353;

using namespace std;
#ifdef ATCODER
using namespace atcoder;
#endif


void solve()
{
    int n;
    scanf("%d", &n);
    int m = n / 2;
    if (n <= 2) {
        printf("1\n");
    }
    else if (n ==3 || n==5) {
        printf("-1\n");
    }
    else if (n % 2 == 0) {
        for (int i = 1; i <= m; i++) {
            printf("%d", i * 2);
            if (i < m) printf(" ");
            else printf("\n");
        }
    }
    else {
        printf("3 6 ");
        for (int i = 1; i <= m; i++) {
            if (i * 2 == 6) continue;
            printf("%d", i * 2);
            if (i < m) printf(" ");
            else printf("\n");
        }
    }

    return;
}

int main()
{
#if 1
    solve();
#else
    int T, t;
    scanf("%d", &T);
    for (t = 0; t < T; t++) {
        //printf("Case #%d: ", t + 1);
        solve();
    }
#endif
    return 0;
}