N=int(input())
K=list(map(int,input().split()))
def isok(a,b,c):
    if a==b or b==c or c==a:
        return False
    if a>b and b<c:
        return True
    if a<b and b>c:
        return True
    return False
def dfs(x):
    st=[]
    for i in range(N):
        for j in range(i):
            for k in range(j):
                if x[i] or x[j] or x[k]:
                    continue
                if not isok(K[i],K[j],K[k]):
                    continue
                x[i]=1
                x[j]=1
                x[k]=1
                st.append(dfs(x))
                x[i]=0
                x[j]=0
                x[k]=0
    if 0 in st:
        return 1
    else:
        return 0
x=[0]*N
if dfs(x)==0:
    print(-1)
    exit()
for i in range(N):
    for j in range(i+1,N):
        for k in range(j+1,N):
            if not isok(K[i],K[j],K[k]):
                continue
            x[i]=1
            x[j]=1
            x[k]=1
            if dfs(x)==0:
                print(i,j,k,'')
                exit()
            x[i]=0
            x[j]=0
            x[k]=0