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

#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y

#define ASSERT(expr...) assert((expr))

using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;

using f32 = float;
using f64 = double;
// }}}

constexpr i64 INF = 1'010'000'000'000'000'017LL;

constexpr i64 MOD = 998244353LL;

constexpr f64 EPS = 1e-12;

constexpr f64 PI = 3.14159265358979323846;

#define M5 100007
#define M9 1000000000

#define F first
#define S second

// util {{{
#define FOR(i, start, end) for (i64 i = (start), CPP_CAT(i, xxxx_end) = (end); i < CPP_CAT(i, xxxx_end); ++i)
#define REP(i, n) FOR(i, 0, n)

#define all(x) (x).begin(), (x).end()
#define ll long long int
#define VI vector<ll>
#define VVI vector<VI>

#define ISD true
#define debug(x) \
    if (ISD)     \
    cout << #x << ": " << x << endl

template <typename T, typename U, typename Comp = less<>>
bool chmax(T &xmax, const U &x, Comp comp = {})
{
    if (comp(xmax, x))
    {
        xmax = x;
        return true;
    }
    return false;
}

template <typename T, typename U, typename Comp = less<>>
bool chmin(T &xmin, const U &x, Comp comp = {})
{
    if (comp(x, xmin))
    {
        xmin = x;
        return true;
    }
    return false;
}

vector<int> permutation;
vector<bool> used; // 追加した
bool isF;
vector<ll> A;
int c = 0;
map<int, int> M;

void dfs(int depth, int size, int min, int max, int ans)
{
    if (isF)
    {
        return;
    }
    if (depth == size)
    {
    }
    else
    {
        for (int i = min; i <= max; i++)
        {
            // i が使用済みの値かどうかを判定
            if (!used[i])
            {
                permutation[depth] = i;
                used[i] = true;
                dfs(depth + 1, size, min, max, ans ^ (A[i] + depth + 1));
                used[i] = false;
            }
        }
    }
}

int main()
{
    int N;
    cin >> N;
    A.resize(N);
    vector<int> P(N);
    REP(i, N)
    {
        cin >> A[i];
        P[i] = i;
    }

    map<int, vector<int>> M;
    do
    {
        ll c = 0;
        REP(i, N)
        {
            c ^= (A[i] + P[i] + 1);
        }
        if (M.count(c) == 1)
        {
            auto ans = M[c];
            for (auto ans0 : ans)
            {
                cout << ans0 + 1 << " ";
            }
            cout << endl;
            for (auto p0 : P)
            {
                cout << p0 + 1 << " ";
            }
            cout << endl;
            return 0;
        }
        M[c] = P;
    } while (next_permutation(all(P)));
    cout << -1 << endl;
    // dfs(0, N, 0, N - 1);
}