#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}

int main(){
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    srand(time(NULL));
    int N;
    cin>>N;
    vector<int>A(N);
    for(int i=0;i<N;i++){
        cin>>A[i];
    }
    vector<int>P(N);
    for(int i=0;i<N;i++)P[i]=i+1;
    if(N<=10){
        map<int,vector<int>>mp;
        do{
            int xr=0;
            for(int i=0;i<N;i++)xr^=P[i]+A[i];
            if(mp.count(xr)){
                for(int i=0;i<N;i++){
                    cout<<mp[xr][i]<<" ";
                }
                cout<<"\n";
                for(int i=0;i<N;i++){
                    cout<<P[i]<<" ";
                }
                cout<<"\n";
                return 0;
            }
            mp[xr]=P;
        }while(next_permutation(all(P)));
        cout<<-1<<"\n";
        return 0;
    }
    map<int,vector<int>>mp;
    int xr=0;
    for(int i=0;i<N;i++)xr^=P[i]+A[i];
    mp[xr]={};
    for(int q=1;;q++){
        int r=rand()%10+2;
        vector<int>v;
        v.push_back(rand()%(N-r+1));
        for(int i=1;i<r;i++){
            v.push_back(v.back()+rand()%(N-(r-i)-v.back())+1);
        }
        int xr2=xr;
        for(int i=0;i<r;i++){
            xr2^=P[v[i]]+A[v[i]];
            xr2^=P[v[(i+1)%r]]+A[v[i]];
        }
        if(mp.count(xr2)){
            if(mp[xr2]!=v){
                vector<int>P1(N),P2(N);
                for(int i=0;i<N;i++){
                    P1[i]=i+1;
                    P2[i]=i+1;
                }
                for(int i=0;i<mp[xr2].size();i++){
                    P1[mp[xr2][i]]=mp[xr2][(i+1)%(int)mp[xr2].size()]+1;
                }
                for(int i=0;i<r;i++){
                    P2[v[i]]=v[(i+1)%r]+1;
                }
                for(int i=0;i<N;i++)cout<<P1[i]<<" ";
                cout<<"\n";
                for(int i=0;i<N;i++)cout<<P2[i]<<" ";
                cout<<"\n";
                return 0;
            }
        }else{
            mp[xr2]=v;
        }
    }
}