def isKadomatsu(a,b,c):
	if b > a > c or b > c > a:return True
	if a > c > b or c > a > b:return True
	return False
def dfs(N,K,used):
	ret = False
	for ii in range(N):
		if used[ii]:continue
		for jj in range(ii + 1,N):
			if used[jj]:continue
			for kk in range(jj + 1,N):
				if used[kk]:continue
				if not isKadomatsu(K[ii],K[jj],K[kk]):continue
				used[ii] = used[jj] = used[kk] = True
				ret = ret or not dfs(N,K,used) 
				used[ii] = used[jj] = used[kk] = False
	return ret
flag = False
N = int(raw_input())
K = map(int,raw_input().split())
used = [False for i in range(N)]
for i in range(N):
	for j in range(i + 1,N):
		for k in range(j + 1,N):
			if not isKadomatsu(K[i],K[j],K[k]):continue
			used[i] = used[j] = used[k] = True
			if not dfs(N,K,used):
				flag = True
				print i,j,k
				break
			used[i] = used[j] = used[k] = False
		if flag:break
	if flag:break
if not flag:
	print -1