import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd, log
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul, add
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from heapq import heappush, heappop
from functools import reduce, lru_cache
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()
K = LIST()

@lru_cache(maxsize=None)
def judge(S):
	ret = False
	for i, j, k in combinations(range(N), 3):
		if (S>>(N-i-1))&1 or (S>>(N-j-1))&1 or (S>>(N-k-1))&1:
			continue
		if not (K[i] < K[j] > K[k] or K[i] > K[j] < K[k]):
			continue
		if not judge(S|1<<(N-i-1)|1<<(N-j-1)|1<<(N-k-1)):
			ret = True
	return ret

for i, j, k in combinations(range(N), 3):
	if not (K[i] < K[j] > K[k] or K[i] > K[j] < K[k]):
		continue
	T = 0
	if not judge(T|1<<(N-i-1)|1<<(N-j-1)|1<<(N-k-1)):
		print(i, j, k)
		break
else:
	print(-1)