import itertools

def read_data():
    N = int(input())
    Ks = list(map(int, input().split()))
    return N, Ks

def solve(N, Ks):
    if N < 3:
        return (-1, )
    for trio in itertools.combinations(range(N), 3):
        if not is_kado(trio, Ks):
            continue
        nKs = [k for i, k in enumerate(Ks) if i not in trio]
        result = solve(N - 3, nKs)
        if result == (-1, ):
            return trio
    return (-1, )

def is_kado(trio, Ks):
    a, b, c = [Ks[i] for i in trio]
    if a == b or b == c or a == c:
        return False
    return max(a, b, c) == b or min(a, b, c) == b
        

N, Ks = read_data()
print(*solve(N, Ks))