#include <bits/stdc++.h>
#include <atcoder/all>
typedef long long int ll;
using namespace std;
typedef pair<ll, ll> P;
using namespace atcoder;
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
#define USE998244353
#ifdef USE998244353
const ll MOD = 998244353;
using mint = modint998244353;
#else
const ll MOD = 1000000007;
using mint = modint1000000007;
#endif

#pragma region //使いがち
const int MAX = 2000001;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}
long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll gcd(ll x, ll y) {
   if (y == 0) return x;
   else if (y > x) {
       return gcd (y, x); 
   }
   else return gcd(x % y, y);
}
ll lcm(ll x, ll y) {
   return x / gcd(x, y) * y;
}
ll my_sqrt(ll x) {
    // 
    ll m = 0;
    ll M = 3000000001;
    while (M - m > 1) {
        ll now = (M + m) / 2;
        if (now * now <= x) {
            m = now;
        }
        else {
            M = now;
        }
    }
    return m;
}
ll keta(ll num, ll arity) {
    ll ret = 0;
    while (num) {
        num /= arity;
        ret++;
    }
    return ret;
}
ll ceil(ll n, ll m) {
    // n > 0, m > 0
    ll ret = n / m;
    if (n % m) ret++;
    return ret;
}
ll pow_ll(ll x, ll n) {
    if (n == 0) return 1;
    if (n % 2) {
        return pow_ll(x, n - 1) * x;
    }
    else {
        ll tmp = pow_ll(x, n / 2);
        return tmp * tmp;
    }
}
void compress(vector<ll>& v) {
    // [3 5 5 6 1 1 10 1] -> [1 2 2 3 0 0 4 0] 
    vector<ll> u = v;
    sort(u.begin(), u.end());
    u.erase(unique(u.begin(),u.end()),u.end());
    map<ll, ll> mp;
    for (int i = 0; i < u.size(); i++) {
        mp[u[i]] = i;
    }
    for (int i = 0; i < v.size(); i++) {
        v[i] = mp[v[i]];
    }
}

// N以下の素数を全て返す
vector<ll> Eratosthenes( const ll N )
{
    vector<bool> is_prime( N + 1 );
    for( ll i = 0; i <= N; i++ )
    {
        is_prime[ i ] = true;
    }
    vector<ll> P;
    for( ll i = 2; i <= N; i++ )
    {
        if( is_prime[ i ] )
        {
            for( ll j = 2 * i; j <= N; j += i )
            {
                is_prime[ j ] = false;
            }
            P.emplace_back( i );
        }
    }
    return P;
}

vector<pair<ll, ll> > prime_factorize(ll N) {
    vector<pair<ll, ll> > res;
    for (ll a = 2; a * a <= N; ++a) {
        if (N % a != 0) continue;
        ll ex = 0; // 指数

        // 割れる限り割り続ける
        while (N % a == 0) {
            ++ex;
            N /= a;
        }

        // その結果を push
        res.push_back({a, ex});
    }

    // 最後に残った数について
    if (N != 1) res.push_back({N, 1});
    return res;
}
#pragma endregion


int xor_sum = 0;

// next_permutationを求める
// ついでにaとのxorも更新
void next_permutation(vector<int>& v, vector<int>& a) {
    int n = v.size();
    int i = n - 1;
    while (i > 0 && v[i - 1] >= v[i]) {
        i--;
    }
    if (i == 0) {
        for (int j = 0; j < n; j++) {
            v[j] = j + 1;
        }
        return ;
    }
    int j = n - 1;
    while (v[j] <= v[i - 1]) {
        j--;
    }
    xor_sum ^= (a[i - 1] + v[i - 1]);
    xor_sum ^= (a[j] + v[j]);
    xor_sum ^= (a[i - 1] + v[j]);
    xor_sum ^= (a[j] + v[i - 1]);
    swap(v[i - 1], v[j]);
    j = n - 1;
    while (i < j) {
        xor_sum ^= (a[i] + v[i]);
        xor_sum ^= (a[j] + v[j]);
        xor_sum ^= (a[i] + v[j]);
        xor_sum ^= (a[j] + v[i]);
        swap(v[i], v[j]);
        i++;
        j--;
    }
}


// i番目のpermutationを出力
void output(int i, int n, vector<int>& a) {
    vector<int> v(n);
    for (int j = 0; j < n; j++) {
        v[j] = j + 1;
    }
    for (int j = 0; j < i; j++) {
        next_permutation(v, a);
    }
    for (int j = 0; j < n; j++) {
        cout << v[j] << " ";
    }
    cout << '\n';
}

int main() {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    vector<int> v(n);
    for (int i = 0; i < n; i++) {
        v[i] = i + 1;
        xor_sum ^= (a[i] + v[i]);
    }
    map<int, int> mp;
    int M = 800000;
    int xx = 1;
    for (int i = 1; i <= n; i++) {
        if (xx * i >= M) break;
        xx *= i;
    }
    M = min(M, xx);
    for (int i = 0; i < xx; i++) {
        if (mp.find(xor_sum) != mp.end()) {
            int id1 = i;
            int id2 = mp[xor_sum];
            cerr << id1 << " " << id2 << '\n';
            output(id1, n, a);
            output(id2, n, a);
            exit(0);
        }
        mp[xor_sum] = i;
        next_permutation(v, a);
    }
    cout << -1 << '\n';
    return 0;
}