#include<iostream>
#include<algorithm>
#include<string>
#include<map>
#include<cmath>
#include<vector>
#include<queue>
#include<set>
#include<stdio.h>
#include <bitset>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define INF 1e9

int n;
vector<int> k;
int used[20];

bool is_kadomatsu(int x, int y, int z)
{
	if ( (k[x] > k[y] && k[z] > k[x]) || (k[z] > k[y] && k[x] > k[z]) ||
	     (k[x] < k[y] && k[z] < k[x]) || (k[z] < k[y] && k[x] < k[z]) ) {
	   	return true;
	} else {
		return false;
	}
}
int I, J, L;
bool dfs(int mask)
{
	for (int i = 0; i < n - 2; i++) {
		for (int j = i + 1; j < n - 1; j++) {
			for (int l = j + 1; l < n; l++) {
				if (~mask & (1 << i) && ~mask & (1 << j) && ~mask & (1 << l)) {
					if (is_kadomatsu(i, j, l)) {
						bool flg = dfs(mask | (1 << i ) | (1 << j) | (1 << l));
						if (!flg) {
							I = i;
							J = j;
							L = l;
							return true;
						}
					}
				}
			}
		}
	}
	return false;
}

int main()
{
	cin >> n;
	rep(i, n) {
		int t;
		cin >> t;
		k.push_back(t);
	}
	if (dfs(0)) {
		cout << I << " " << J << " " << L << endl;
	} else {
		cout << -1 << endl;
	}
	return 0;
}