n = int(input())
A = list(map(int, input().split()))

# 遷移先がある場合は1としている
DP = [0 for _ in range(1 << n)]
for bit in range(1 << n):
    if DP[bit]:
        continue
    for i in range(n):
        if (bit >> i) & 1:
            continue
        for j in range(i + 1, n):
            if (bit >> j) & 1:
                continue
            for k in range(j + 1, n):
                if (bit >> k) & 1:
                    continue
                if A[i] != A[k] and (A[i] > A[j] < A[k] or A[i] < A[j] > A[k]):
                    nbit = bit
                    nbit |= (1 << i)
                    nbit |= (1 << j)
                    nbit |= (1 << k)
                    DP[nbit] = 1

for i in range(n):
    for j in range(i + 1, n):
        for k in range(j + 1, n):
            if A[i] != A[k] and (A[i] > A[j] < A[k] or A[i] < A[j] > A[k]):
                bit = (1 << n) - 1
                bit ^= 1 << i
                bit ^= 1 << j
                bit ^= 1 << k
                if DP[bit] == 0:
                    print(i, j, k)
                    exit()
print(-1)