#yuki334
import itertools


def iskd(t,l):
    a,b,c = [l[i] for i in t]
    if a==b or b==c or a==c:
        return False
    return max(a,b,c)==b or min(a,b,c) == b
  

def solve(n,l):
 if n<3:
  return (-1, )
 for t in itertools.combinations(range(n),3):
  if not iskd(t,l):
   continue
  ks=[k for i,k in enumerate(l) if i not in t]
  res=solve(n-3,ks)
  if res==(-1, ):
   return t
 return (-1, )

n=int(input())
l=list(map(int,input().split()))        
print(*solve(n,l))