#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <functional>
#include <iomanip>
using namespace std;
using ll = long long;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n_):i({0}),n({n_}){}range(int i_,int n_):i({i_}),n({n_}){}I& begin(){return i;}I& end(){return n;}};

template<typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }

#ifdef ONLINE_JUDGE
#define dump(expr) ;
#else
#define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; }
#endif

namespace solver {

int n;
vector<ll> vs;

void read() {
  cin >> n;
  vs.resize(n);
  for (int i : range(n)) cin >> vs[i];
}

ll run() {
  const int fix = 30;
  vector<ll> ps(n);
  for (int i : range(n)) ps[i] = i + 1;

  ll prefsum = 0;
  int start = max(0, n - fix);
  for (int i : range(start)) prefsum ^= ps[i] + vs[i];
  dump(prefsum);

  map<ll, vector<ll>> seen;
  do {
    ll sum = prefsum;
    for (int i : range(start, n)) sum ^= ps[i] + vs[i];
    dump(sum);

    if (seen.count(sum)) {
      for (int i : range(start)) cout << i + 1 << " ";
      for (ll x : seen[sum]) cout << x << " ";
      cout << endl;
      for (ll x : ps) cout << x << " ";
      cout << endl;
      return 0;
    }

    vector<ll> part(ps.begin() + start, ps.end());
    seen[sum] = part;

  } while (next_permutation(ps.begin() + start, ps.end()));
  cout << -1 << endl;
  return 0;
}

}

int main(int argc, char** argv) {
  cout << fixed << setprecision(12);
  int testcase = 1;
  if (argc > 1) testcase = atoi(argv[1]);
  while (testcase--) {
    solver::read();
  }
  solver::run();
}