#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	if (1 == n) {
		cout << -1 << endl;
		return 0;
	}
	vector v(3, vector<int>());
	rep(i, 3)v.reserve(n);
	int now = 0;
	if (2 == n % 3) {
		v[0] = { 0,3 };
		v[1] = { 2,5 };
		v[2] = { 4,1 };
		now = 6;
		n -= 2;
	}
	else if (1 == n % 3) {
		v[0] = { 0,1,3,10 };
		v[1] = { 6,8,9,11 };
		v[2] = { 7,4,5,2 };
		now = 12;
		n -= 4;
	}
	while (n) {
		vector<vector<int>>tmp = {
			{0,1,8},{5,7,6},{2,3,4}
		};
		rep(i, 3) {
			rep(j, tmp[i].size()) {
				v[i].push_back(now + tmp[i][j]);
			}
		}
		now += 9;
		n -= 3;
	}
	rep(i, 3)rep(j, v[i].size())cout << v[i][j] + 1 << " ";
	cout << endl;
	return 0;
}