def is_kadomatsu(x,y,z):
    if x==y or y==z or z==x:
        return False
    return (x>y<z) or (x<y>z)

def bit(i,j,k):
    return (1<<i)+(1<<j)+(1<<k)

def f(S):
    if Flag[S]!=-1:
        return Flag[S]

    for i in range(N):
        for j in range(i+1,N):
            for k in range(j+1,N):
                if bit(i,j,k)&S or (not is_kadomatsu(K[i],K[j],K[k])):
                    continue

                if not f(S|bit(i,j,k)):
                    Flag[S]=1
                    return 1

    Flag[S]=0
    return 0

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

if f(0)==0:
    print(-1)
else:
    for i in range(N):
        for j in range(i+1,N):
            for k in range(j+1,N):
                if not Flag[bit(i,j,k)]:
                    print(i,j,k)
                    exit()