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

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

n = II()
aa = LI()

seen = {}
even = -1
j = -1
for i, a in enumerate(aa):
    if a in seen: 
        j = seen[a]
    else:
        seen[a]=i
    if a & 1 == 0:
        if even == -1:
            even = i
        else:
            j = even
    if j != -1:
        p = [-1]*n
        q = [-1]*n
        # print(i, j)
        p[i] = q[j] = 2
        p[j] = q[i] = 3
        for arr in [p, q]:
            a = 1
            for k in range(n):
                if arr[k] == -1:
                    arr[k] = a
                    if a == 1: a = 4
                    else: a += 1
        # print(f(aa, p), f(aa, q))
        print(*p)
        print(*q)
        exit()

print(-1)