import sys

sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

md = 10**9+7
# md = 998244353

from itertools import permutations

def f(aa, pp):
    x = 0
    for a, p in zip(aa, pp):
        x ^= a+p
    return x

n = II()
aa = LI()

if n == 1:
    print(-1)
elif n == 2:
    x = aa[0]+1 ^ aa[1]+2
    y = aa[0]+2 ^ aa[1]+1
    if x == y:
        print(1, 2)
        print(2, 1)
    else:
        print(-1)
else:
    bb = aa[:3]
    x2p = {}
    for p in permutations(range(1, 4)):
        x = f(aa, p)
        if x in x2p:
            ans = list(p)+list(range(4, n+1))
            print(*ans)
            ans = list(x2p[x])+list(range(4, n+1))
            print(*ans)
            exit()
        x2p[x] = p