#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);

    //500000<=2^19-1=524287
    //総XORは524287以下
    //最初の10項を並び替えるだけで3628800通りの値が作れる
    
    int N, S, M;
    cin >> N;
    M = min(N, 10);
    vector<int> A(N);
    for (int i=0; i<N; i++) cin >> A[i];
    vector<int> p(M);
    iota(p.begin(), p.end(), 1);
    vector<vector<int>> v(550000);

    if (N<=9){
        do{
            S = 0;
            for (int i=0; i<M; i++){
                S ^= p[i]+A[i];
            }
            if (v[S].size() == 0) v[S] = p;
            else{
                for (auto x : p) cout << x << " ";
                cout << endl;
                for (auto x : v[S]) cout << x << " ";
                cout << endl;
                return 0;
            }
        } while(next_permutation(p.begin(), p.end()));
        cout << -1 << endl;
        return 0;
    }
    do{
        S = 0;
        for (int i=0; i<M; i++){
            S ^= (p[i]+A[i]);
        }
        if (v[S].size() == 0) v[S] = p;
        else{
            for (auto x : p) cout << x << " ";
            for (int i=11; i<=N; i++) cout << i << " ";
            cout << endl;
            for (auto x : v[S]) cout << x << " ";
            for (int i=11; i<=N; i++) cout << i << " ";
            cout << endl;
            return 0;
        }
    } while(next_permutation(p.begin(), p.end()));

    return 0;
}