import sys

sys.setrecursionlimit(10 ** 6)

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(0, 1), (1, 0), (0, -1), (-1, 0)]

def main():
    def iskado(i, j, k):
        if aa[i] <= aa[j] <= aa[k]: return False
        if aa[k] <= aa[j] <= aa[i]: return False
        if aa[i] == aa[j] or aa[i] == aa[k] or aa[k] == aa[j]: return False
        return True

    memo = {}

    def solve(bit):
        if bit in memo: return memo[bit]
        for i in range(n - 2):
            if bit >> i & 1: continue
            nbit1 = bit | (1 << i)
            for j in range(i + 1, n - 1):
                if bit >> j & 1: continue
                nbit2 = nbit1 | (1 << j)
                for k in range(j + 1, n):
                    if bit >> k & 1: continue
                    if not iskado(i, j, k): continue
                    ret = solve(nbit2 | 1 << k)
                    if ret[0] == -1:
                        memo[bit] = (i, j, k)
                        return (i, j, k)
        memo[bit] = (-1, -1, -1)
        return (-1, -1, -1)

    n = II()
    aa = LI()
    ans = solve(0)
    if ans[0]==-1:print(-1)
    else:print(*ans)

main()