from itertools import combinations

def dfs(S):
    if memo[S]!=-1:
        return memo[S]
    
    idx = []
    
    for i in range(N):
        if not (S>>i)&1:
            idx.append(i)

    res = False
    
    for a, b, c in combinations(idx, 3):
        if (K[a]<K[b] and K[b]>K[c]) or (K[a]>K[b] and K[b]<K[c]):
            S_ = S
            S_ |= 1<<a
            S_ |= 1<<b
            S_ |= 1<<c
            res |= not dfs(S_)
    
    memo[S] = res
    
    return res

N = int(input())
K = list(map(int, input().split()))
memo = [-1]*(1<<N)
dfs(0)

for a, b, c in combinations(range(N), 3):
    S = 0
    S |= 1<<a
    S |= 1<<b
    S |= 1<<c
    
    if memo[S]==False:
        print(a, b, c)
        exit()
        
print(-1)