#include <bits/stdc++.h>
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int N; cin >> N;
    if(N == 1){cout << -1 << endl; return 0;}
    vector<pair<int,int>> A(N);
    for(int i=0; i<N; i++) cin >> A.at(i).first,A.at(i).second = i;
    sort(A.begin(),A.end());

    set<int> idx;
    for(int i=1; i<=N; i++) idx.insert(i);

    int swap1 = -1,swap2 = -1;
    vector<int> answer(N);
    for(int i=0; i<N-1; i++){
        auto[a1,pos1] = A.at(i); auto[a2,pos2] = A.at(i+1);
        if(a1 == a2){
            swap1 = pos1,swap2 = pos2;
            answer.at(pos1) = 1,answer.at(pos2) = 2;
            idx.erase(1); idx.erase(2); break;
        }
        vector<int> same,diff;
        for(int k=0; k<20; k++){
            if((a1&(1<<k)) != (a2&(1<<k))) diff.push_back(1<<k);
            else same.push_back(1<<k);
        }
        sort(same.begin(),same.end());
        sort(diff.begin(),diff.end());

        int mind = diff.at(0)+same.at(0);
        if(diff.size() > 1) mind = min(mind,diff.at(1));
        if(mind > N) continue;
        swap1 = pos1,swap2 = pos2;
        if(diff.size() > 1) if(mind == diff.at(1)){
            answer.at(pos1) = mind,answer.at(pos2) = diff.at(0);
            idx.erase(mind),idx.erase(diff.at(0)); break;
        }
        answer.at(pos1) = mind,answer.at(pos2) = mind-diff.at(0);
        idx.erase(mind); idx.erase(mind-diff.at(0));
        break;
    }
    if(swap1 == -1){cout << -1 << endl; return 0;}
 
    for(auto &a : answer) if(a == 0) a = *idx.begin(),idx.erase(idx.begin());
    for(int i=0; i<N; i++) cout << answer.at(i) << (i==N-1?"\n":" ");
    for(int i=0; i<N; i++){
        if(i != swap1 && i != swap2) cout << answer.at(i) << (i==N-1?"\n":" ");
        if(i == swap1) cout << answer.at(swap2) << (i==N-1?"\n":" ");
        if(i == swap2) cout << answer.at(swap1) << (i==N-1?"\n":" ");
    }
}