/* -*- coding: utf-8 -*-
 *
 * 2732.cc:  No.2732 Similar Permutations - yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 200000;
const int BN = 19;
const int BITS = 1 << BN;

/* typedef */

typedef vector<int> vi;

/* global variables */

int as[MAX_N];
vi bvs[BITS];

/* subroutines */

void printv(vi &v, int n) {
  int l = v.size();
  for (int i = 0; i < n; i++) {
    int u = (i < l) ? v[i] : i + 1;
    printf("%d%c", u, (i + 1 < l) ? ' ' : '\n');
  }
}

/* main */

int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", as + i);

  int k = min(10, n);
  vi ps(k);
  for (int i = 0; i < k; i++) ps[i] = i + 1;

  do {
    int x = 0;
    for (int i = 0; i < k; i++) x ^= (ps[i] + as[i]);

    if (! bvs[x].empty()) {
      printv(ps, n);
      printv(bvs[x], n);
      return 0;
    }
    bvs[x] = ps;
  } while (next_permutation(ps.begin(), ps.end()));

  puts("-1");
  return 0;
}