#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x ostream& operator<<(ostream& os, const pair& p){ return os << "{" << p.first << ", " << p.second << "}"; } template ostream& operator<<(ostream& os, const vector& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } template ostream& operator<<(ostream& os, const set& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } template ostream& operator<<(ostream& os, const map& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } template void take(vector& vec, int n) { vec.resize(n); for (int i = 0; i < n; ++i) cin >> vec[i]; } #ifdef ONLINE_JUDGE #define dump(expr) ; #else #define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; } #endif namespace solver { template struct In2 { T1 a; T2 b; friend std::istream& operator>>(std::istream& is, In2& obj) { T1 t1; T2 t2; is >> t1 >> t2; obj = {t1, t2}; return is; } }; template struct In3 { T1 a; T2 b; T3 c; friend std::istream& operator>>(std::istream& is, In3& obj) { T1 t1; T2 t2; T3 t3; is >> t1 >> t2 >> t3; obj = {t1, t2, t3}; return is; } }; int n; void read() { cin >> n; } void expe() { vector v(6); for (int i : range(6)) v[i] = i + 1; do { if (v[0] * v[2] + v[1] * v[3] == v[4] * v[2] + v[5] * v[3]) { dump(v); break; } } while (next_permutation(v.begin(), v.end())); } using RetType = void; RetType run() { if (n == 1) { cout << "-1" << endl; return; } vector res; if (n == 2) { res = {1, 4, 3, 6, 5, 2}; } else { res.assign(3 * n, 0); for (ll i : range(n)) res[n + i] = i + 1; int s[4] = {0, 1, 1, 0}; for (ll i : range(n)) { ll lo = n + 2 * i + 1; ll hi = n + 2 * i + 2; ll j = i, k = 2 * n + i; if (n % 4 == 0) { if (s[i % 4]) swap(j, k); } if (n % 4 == 3) { if (i < 3) { if (i == 2) swap(j, k); } else { if (s[(i - 3) % 4]) swap(j, k); } } if (n % 4 == 1 || n % 4 == 2) { if (i == 0) lo = n + 1, hi = n + 3; if (i == 1) lo = n + 2, hi = n + 4; } if (n % 4 == 1) { if (i < 5) { if (i < 3) swap(j, k); } else if (s[(i - 5) % 4]) swap(j, k); } if (n % 4 == 2) { if (i < 6) { if (i == 0) swap(j, k); if (i == 3) swap(j, k); if (i == 5) swap(j, k); } else if (s[(i - 6) % 4]) swap(j, k); } res[j] = lo, res[k] = hi; } } dump(res); ll sum1 = 0, sum2 = 0; for (ll i : range(n)) { sum1 += res[n + i] * res[i]; sum2 += res[n + i] * res[2 * n + i]; } dump(sum1 << " " << sum2); assert(sum1 == sum2); for (auto e : res) cout << e << " "; cout << endl; } } // namespace template void run(F f) { if constexpr (std::is_same_v) f(); else cout << f() << endl; } int main(int argc, char** argv) { cerr << fixed << setprecision(12); cout << fixed << setprecision(12); int testcase = 1; if (argc > 1) testcase = atoi(argv[1]); while (testcase--) { solver::read(); } run(solver::run); }