N = int(input())
A = list(map(int,input().split()))

def naive(A):
    from itertools import permutations
    for i in permutations(range(1,N+1)):
        a = [i[k] + A[k] for k in range(N)]
        xor1 = 0
        for k in a:xor1 ^= k
        for j in permutations(range(1,N+1)):
            if(i == j):continue
            b = [j[k] + A[k] for k in range(N)]
            xor2 = 0
            for k in b:xor2 ^= k
            
            if(xor1 == xor2):
                print(*i)
                print(*j)
                exit()

naive(A)
print(-1)