#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  constexpr int L = 10;
  int n; cin >> n;
  vector<int> a(n);
  for (int& a_i : a) cin >> a_i;
  vector<int> p(min(n, L));
  iota(p.begin(), p.end(), 1);
  array<vector<int>, 1 << 19> memo{};
  do {
    int x = 0;
    REP(i, p.size()) x ^= a[i] + p[i];
    if (!memo[x].empty()) {
      vector<int> q(n);
      iota(q.begin(), q.end(), 1);
      ranges::copy(memo[x], q.begin());
      REP(i, n) cout << q[i] << " \n"[i + 1 == n];
      ranges::copy(p, q.begin());
      REP(i, n) cout << q[i] << " \n"[i + 1 == n];
      return 0;
    }
    memo[x] = p;
  } while (ranges::next_permutation(p).found);
  cout << "-1\n";
  return 0;
}