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

int main(){
    int n;cin>>n;
    vector<int> a(n);
    int xr=0;
    vector<pair<int,int>> b(300000,{-1,0});
    for(int i=0;i<n;i++){
        cin>>a[i];
        xr^=a[i]+i+1;
    }
    if(n<1500){
        vector<int> p(n);
        for(int i=0;i<n;i++)p[i]=i;
        vector<vector<int>> st(300000);
        do{
            int x=0;
            for(int i=0;i<n;i++)x^=a[i]+p[i]+1;
            if(st[x].size()==0)st[x]=p;
            else{
                for(int i=0;i<n;i++)cout<<st[x][i]+1<<" \n"[i+1==n];
                for(int i=0;i<n;i++)cout<<p[i]+1<<" \n"[i+1==n];
                return 0;
            }
        }while(next_permutation(p.begin(),p.end()));
        cout<<-1<<"\n";
        return 0;
    }
    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            int k=xr^(a[i]+i+1)^(a[j]+j+1)^(a[j]+i+1)^(a[i]+j+1);
            if(b[k].first==-1){
                b[k]={i,j};
                continue;
            }else{
                for(int ii=0;ii<n;ii++){
                    if(ii==b[k].first)cout<<b[k].second+1;
                    else if(ii==b[k].second)cout<<b[k].first+1;
                    else cout<<ii+1;
                    cout<<" \n"[ii+1==n];
                }
                for(int ii=0;ii<n;ii++){
                    if(ii==i)cout<<j+1;
                    else if(ii==j)cout<<i+1;
                    else cout<<ii+1;
                    cout<<" \n"[ii+1==n];
                }
                return 0;
            }
        }
    }
    cout<<-1<<"\n";
}