#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000

int N;
int K[12];
int A, B, C;

bool check(int a, int b, int c) {
	return (a - b) * (c - b) > 0;
}

bool dfs(vector<bool> used) {
	rep(i, N) {
		REP(j,i + 1,  N - 1) {
			REP(k,j + 1, N - 1) {
				if (used[i] || used[j] || used[k]) continue;
				if (!check(K[i], K[j], K[k])) continue;
				used[i] = used[j] = used[k] = true;
				//cout << K[i] << " " << K[j] << " " << K[k] << endl;
				if (dfs(used)) {
					used[i] = used[j] = used[k] = false;
					continue;
				}
				A = i;  B = j; C = k;
				return true;
			}
		}
	}
	return false;
}


int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
	cin >> N;
	rep(i, N) cin >> K[i];
	vector<bool> used;
	rep(i, N) used.push_back(false);
	if (dfs(used)) {
		cout << A << " " << B << " " << C << endl;
	}
	else {
		cout << -1 << endl;
	}


    return 0;
}