#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #if __has_include() #include #endif #define GET_MACRO(_1, _2, _3, NAME, ...) NAME #define _rep(i, n) _rep2(i, 0, n) #define _rep2(i, a, b) for (int i = (int)(a); i < (int)(b); i++) #define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define UNIQUE(x) \ std::sort((x).begin(), (x).end()); \ (x).erase(std::unique((x).begin(), (x).end()), (x).end()) using i64 = long long; template bool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; } template bool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; } template inline void YesNo(bool f = 0, const T yes = "Yes", const U no = "No") { if (f) std::cout << yes << "\n"; else std::cout << no << "\n"; } namespace io { template istream& operator>>(istream& i, pair& p) { i >> p.first >> p.second; return i; } template istream& operator>>(istream& i, vector& v) { rep(j, v.size()) i >> v[j]; return i; } template string join(vector& v) { stringstream s; rep(i, v.size()) s << ' ' << v[i]; return s.str().substr(1); } template ostream& operator<<(ostream& o, vector& v) { if (v.size()) o << join(v); return o; } template string join(vector>& vv) { string s = "\n"; rep(i, vv.size()) s += join(vv[i]) + "\n"; return s; } template ostream& operator<<(ostream& o, vector>& vv) { if (vv.size()) o << join(vv); return o; } template ostream& operator<<(ostream& o, pair& p) { o << p.first << " " << p.second; return o; } void OUT() { std::cout << "\n"; } template void OUT(Head&& head, Tail&&... tail) { std::cout << head; if (sizeof...(tail)) std::cout << ' '; OUT(std::forward(tail)...); } void OUTL() { std::cout << std::endl; } template void OUTL(Head&& head, Tail&&... tail) { std::cout << head; if (sizeof...(tail)) std::cout << ' '; OUTL(std::forward(tail)...); } void IN() {} template void IN(Head&& head, Tail&&... tail) { cin >> head; IN(std::forward(tail)...); } } // namespace io using namespace io; namespace useful { long long modpow(long long a, long long b, long long mod) { long long res = 1; while (b) { if (b & 1) res *= a, res %= mod; a *= a; a %= mod; b >>= 1; } return res; } bool is_pow2(long long x) { return x > 0 && (x & (x - 1)) == 0; } template void rearrange(vector& a, vector& p) { vector b = a; for (int i = 0; i < int(a.size()); i++) { a[i] = b[p[i]]; } return; } template vector> rle_sequence(vector& a) { vector> res; int n = a.size(); int l = 1; rep(i, n - 1) { if (a[i] == a[i + 1]) l++; else { res.emplace_back(a[i], l); l = 1; } } res.emplace_back(a.back(), l); return res; } vector> rle_string(string a) { vector> res; int n = a.size(); if (n == 1) return vector>{{a[0], 1}}; int l = 1; rep(i, n - 1) { if (a[i] == a[i + 1]) l++; else { res.emplace_back(a[i], l); l = 1; } } res.emplace_back(a.back(), l); return res; } vector linear_sieve(int n) { vector primes; vector res(n + 1); iota(all(res), 0); for (int i = 2; i <= n; i++) { if (res[i] == i) primes.emplace_back(i); for (auto j : primes) { if (j * i > n) break; res[j * i] = j; } } return res; // return primes; } template vector dijkstra(vector>>& graph, int start) { int n = graph.size(); vector res(n, 2e18); res[start] = 0; priority_queue, vector>, greater>> que; que.push({0, start}); while (!que.empty()) { auto [c, v] = que.top(); que.pop(); if (res[v] < c) continue; for (auto [nxt, cost] : graph[v]) { auto x = c + cost; if (x < res[nxt]) { res[nxt] = x; que.push({x, nxt}); } } } return res; } } // namespace useful using namespace useful; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); clock_t start = clock(); int n; IN(n); vector a(n); IN(a); if (n <= 5) { vector p(n), q(n); iota(all(p), 1); iota(all(q), 1); do { int tt = 0; rep(i, n) tt ^= a[i] + q[i]; do { int ss = 0; rep(i, n) ss ^= a[i] + p[i]; if (ss == tt && p != q) { OUT(p); OUT(q); return 0; } } while (next_permutation(all(p))); } while (next_permutation(all(q))); OUT(-1); return 0; } if (n == 1) { OUT(-1); return 0; } vector p(n), q(n); vector t(n); iota(all(t), 0); sort(all(t), [&](int i, int j) { return a[i] < a[j]; }); rep(i, n - 1) { if (a[t[i + 1]] == a[t[i]]) { p[t[i]] = 1; p[t[i + 1]] = 2; q[t[i]] = 2; q[t[i + 1]] = 1; int s = 3; rep(j, n) { if (j == i || j == i + 1) continue; p[t[j]] = q[t[j]] = s++; } OUT(p); OUT(q); return 0; } } rep(i, n - 2) { if (a[t[i + 2]] - a[t[i]] < n) { int x = 1, y = x + (a[t[i + 1]] - a[t[i]]), z = y + (a[t[i + 2]] - a[t[i + 1]]); p[t[i]] = z; p[t[i + 1]] = x; p[t[i + 2]] = y; q[t[i]] = y; q[t[i + 1]] = z; q[t[i + 2]] = x; int s = 2; rep(j, n) { while (s == y || s == z) s++; if (p[t[j]] == 0) { p[t[j]] = s; q[t[j]] = s++; } } OUT(p); OUT(q); return 0; } } vector o, e; rep(i, n) { if (a[i] & 1) { o.push_back(i); } else { e.push_back(i); } } if (o.size() == 1 && e.size() == 1) { OUT(-1); return 0; } if (o.size() < e.size()) swap(o, e); assert(o.size() >= 2); int s = 3; rep(i, n) { if (i == o[0]) { p[i] = 1; q[i] = 2; } else if (i == o[1]) { p[i] = 2; q[i] = 1; } else { p[i] = s; q[i] = s++; } } i64 xx = 0, yy = 0; rep(i, n) { xx ^= p[i] + a[i]; yy ^= q[i] + a[i]; } if (xx == yy) { OUT(p); OUT(q); return 0; } vector per(n); iota(all(per), 1); map> mp; do { int ss = 0; rep(i, n) ss ^= a[i] + per[i]; if (mp.contains(ss)) { OUT(per); OUT(mp[ss]); return 0; } if (clock() - start >= 1950000) { OUT(-1); return 0; } mp[ss] = per; } while (next_permutation(all(per))); }