#include <iostream>
#include <queue>
#include <map>
#include <list>
#include <vector>
#include <string>

using namespace std;

#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)

#define inf INT_MAX/3
#define INF INT_MAX/3
#define PB push_back
#define MP make_pair
#define ALL(a) (a).begin(),(a).end()
#define SET(a,c) memset(a,c,sizeof a)
#define CLR(a) memset(a,0,sizeof a)
#define pii pair<int,int>
#define pcc pair<char,char>
#define pic pair<int,char>
#define pci pair<char,int>
#define VS vector<string>
#define VI vector<int>
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define MIN(a,b) (a>b?b:a)
#define MAX(a,b) (a>b?a:b)
#define pi 2*acos(0.0)
#define INFILE() freopen("in0.txt","r",stdin)
#define OUTFILE()freopen("out0.txt","w",stdout)
#define in scanf
#define out printf
#define LL long long
#define ULL unsigned long long
#define eps 1e-14
#define FST first
#define SEC second

int k[12];
bool isMatsu(int a, int b, int c) {
	if (k[a] == k[b] || k[b] == k[c] || k[a] == k[c]) return false;
	if (k[a] < k[b] && k[b] < k[c]) return false;
	if (k[a] > k[b] && k[b] > k[c]) return false;
	return true;
}

int main(void) {
	int N; cin >> N;
	REP(i, N) cin >> k[i];
	bool isWin[5000] = {};

	isWin[0] = false;
	//bitが2個未満のやつはすべて死
	for (int i = 0; i < N; ++i) {
		for (int j = 0; j < N; ++j) {
			isWin[(1 << i) | (1 << j)] = false;
		}
	}

	for (int n = 0; n < (1 << N); ++n) {
		for (int a = 0; a < N; ++a) for (int b = a + 1; b < N; ++b) for (int c = b + 1; c < N; ++c) {
			if ((n >> a) & 1 && (n >> b) & 1 && (n >> c) & 1) {
				if (!isMatsu(a, b, c)) continue;
				if (!isWin[n - (1 << a) - (1 << b) - (1 << c)]) { //相手を敗北に導けるならこちらが勝利
					isWin[n] = true;
					goto END;
				}
			}
		}
	END:;
	}

	if (!isWin[(1 << N) - 1]) {
		cout << -1 << endl; //勝つことが不可能
		return 0;
	}
	int n = (1 << N) - 1;
	//辞書順に勝つことができる手法を選択
	for (int a = 0; a < N; ++a) {
		for (int b = a + 1; b < N; ++b) {
			for (int c = b + 1; c < N; ++c) {
				if (isMatsu(a,b,c) && !isWin[n - (1 << a) - (1 << b) - (1 << c)]) {
					cout << a << " " << b << " " << c << endl;
					return 0;
				}
			}
		}
	}

	return 0;
}