#include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
#include <cassert>

bool judge(const std::vector<int>& xs) {
    int n = xs.size() / 3;
    std::vector<std::vector<int>> idxs(n, std::vector<int>(3, -1));

    bool ret = true;
    for (int i = 0; i < n * 3; ++i) {
        auto& is = idxs[xs[i]];
        for (int j = 0; j < 3; ++j) {
            if (is[j] == -1) {
                is[j] = i;
                break;
            }
        }

        if (is.back() == -1) continue;
        auto d = std::abs((is[1] - is[0]) - (is[2] - is[1]));
        if (d != xs[i]) {
            ret = false;
            break;
        }
    }

    return ret;
}

void brute() {
    int l, n;
    std::cin >> l >> n;

    std::vector<int> xs(n * 3);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < 3; ++j) {
            xs[i * 3 + j] = l + i;
        }
    }

    do {
        if (!judge(xs)) continue;
        for (auto x : xs) std::cout << x << " ";
        std::cout << std::endl;
        break;
    } while (std::next_permutation(xs.begin(), xs.end()));
}

const std::vector<std::vector<int>>
    normal_sol{
        {},
        {0, 0, 0},
        {},
        {2, 2, 1, 1, 2, 1, 0, 0, 0},
        {3, 3, 0, 0, 0, 3, 2, 2, 1, 1, 2, 1},
        {0, 0, 0, 1, 1, 2, 1, 3, 4, 4, 2, 3, 3, 2, 4}},
    sep_sol{
        {},
        {},
        {1, -1, 1, 1, 0, 0, 0},
        {1, -1, 1, 0, 2, 1, 0, 2, 2, 0},
        {3, -1, 3, 1, 1, 2, 1, 3, 2, 2, 0, 0, 0},
    };

void solve() {
    int n;
    std::cin >> n;

    if (n == 2) {
        std::cout << -1 << std::endl;
        return;
    }

    int l = 0, r = n * 3 - 1;
    std::vector<int> ans(n * 3, -1);
    bool sep = false;

    while (n > (sep ? 4 : 5)) {
        if (!sep) {
            if (n % 2 != 0) {
                // 665544654...
                for (int x = n - 1; x >= n / 2; --x) {
                    ans[l] = ans[l + 1] = ans[l + x + 2] = x;
                    l += 2;
                }
                l += n - n / 2;
                n = n / 2;

            } else {
                // 77665544376543.3...
                for (int x = n - 1; x >= n / 2; --x) {
                    ans[l] = ans[l + 1] = ans[l + 1 + x + 1] = x;
                    l += 2;
                }
                {
                    int x = n / 2 - 1;
                    ans[l] = ans[l + x + 2] = ans[l + x + 4] = x;
                    l += 1;
                }
                l += n - (n / 2 - 1);
                n = n / 2 - 1;
                sep = true;
            }
        } else {
            if (n % 2 != 0) {
                // ...456445566
                for (int x = n - 1; x >= n / 2; --x) {
                    ans[r] = ans[r - 1] = ans[r - x - 2] = x;
                    r -= 2;
                }
                r -= n - n / 2;
                n = n / 2;

            } else {
                // 7x66554477654...
                ans[l] = ans[l + n] = ans[l + n + 1] = n - 1;
                l += 2;
                for (int x = n - 2; x >= n / 2; --x) {
                    ans[l] = ans[l + 1] = ans[l + 1 + x + 1] = x;
                    l += 2;
                }
                l += n - n / 2 + 1;
                n = n / 2;
                sep = false;
            }
        }
    }

    auto sol = (!sep ? normal_sol : sep_sol);
    for (auto x : sol[n]) {
        if (x != -1) ans[l] = x;
        ++l;
    }

    for (auto a : ans) std::cout << a << " ";
    std::cout << std::endl;

    assert(judge(ans));
}

int main() {
    // brute();
    solve();
    return 0;
}