import copy
import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict
import bisect

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')


def index_lt(a, x):
    'return largest index s.t. A[i] < x or -1 if it does not exist'
    return bisect.bisect_left(a, x) - 1


def index_le(a, x):
    'return largest index s.t. A[i] <= x or -1 if it does not exist'
    return bisect.bisect_right(a, x) - 1


def index_gt(a, x):
    'return smallest index s.t. A[i] > x or len(a) if it does not exist'
    return bisect.bisect_right(a, x)


def index_ge(a, x):
    'return smallest index s.t. A[i] >= x or len(a) if it does not exist'
    return bisect.bisect_left(a, x)


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

kado = {}
for a, b, c in itertools.combinations(range(N), 3):
    X, Y, Z = K[a], K[b], K[c]
    A = (X, Y, Z)
    if X == Y or Y == Z or Z == X:
        kado[(a, b, c)] = False
    elif min(A) == Y or max(A) == Y:
        kado[(a, b, c)] = True
    else:
        kado[(a, b, c)] = False
winable = {}
nxt = {}


def dfs(s):
    ts = tuple(s)
    if winable.get(ts) is not None:
        return winable[ts]
    res = False
    for c in itertools.combinations(s, 3):
        if kado[c] is True:
            ns = copy.deepcopy(s)
            for i in c:
                ns.remove(i)
            if dfs(ns) is False:
                if nxt.get(ts) is None:
                    nxt[ts] = c
                res = True
    winable[ts] = res
    return winable[ts]


s = {i for i in range(N)}
dfs(s)
if winable[tuple(s)] is False:
    print(-1)
else:
    print(*nxt[tuple(s)])