from itertools import combinations as comb
N = int(raw_input())
K = map(int,raw_input().split())
memo = dict()
def check(a,b,c):
	return (K[a]-K[b])*(K[c]-K[b])>0 and K[a] != K[c] 
def dfs(k):
	if bin(k).count("1") < 3:
		return False
	if k not in memo:
		l = [i for i in xrange(N) if ((1<<i)&k) != 0]
		tmp = False
		for a,b,c in comb(l,3):
			if check(a,b,c):
				nk = k - (1<<a) - (1<<b) - (1<<c)
				tmp |= not dfs(nk)
		memo[k] = tmp
	return memo[k]
ans = []
for a,b,c in comb(range(N),3):
	if check(a,b,c) and not dfs((1<<N) - 1 - (1<<a) - (1<<b) - (1<<c)):
		ans.append((a,b,c))
if ans:
	ans.sort()
	print ans[0][0],ans[0][1],ans[0][2]
else:
	print -1