#define _CRT_SECURE_NO_WARNINGS
#include<sstream>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
#include<tuple>
#include<unordered_set>
#include<random>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())


int n;
int arr[12];


bool kadomatsu(int x,int y,int z){
	return x != z && (x > y && y < z || x < y && y > z);
}



int dfs(int bits) {
	for (int i = 0; i < n; i++)if (bits >> i & 1) {
		for (int j = i + 1; j < n; j++)if (bits >> j & 1) {
			for (int k = j + 1; k < n; k++)if (bits >> k & 1) {
				if (kadomatsu(arr[i],arr[j],arr[k]) && dfs(bits ^ 1 << i ^ 1 << j ^ 1 << k) == -1) {
					return 1;
				}
			}
		}
	}
	return -1;
}



int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	rep(i,n)cin>>arr[i];
	tuple<int, int, int> ans(-1, -1, -1);
	int bits = (1 << n) - 1;
	for (int i = 0; i < n; i++)if (bits >> i & 1) {
		for (int j = i + 1; j < n; j++)if (bits >> j & 1) {
			for (int k = j + 1; k < n; k++)if (bits >> k & 1) {
				if (kadomatsu(arr[i], arr[j], arr[k]) && dfs(bits ^ 1 << i ^ 1 << j ^ 1 << k) == -1) {
					cout << i << ' ' << j << ' ' << k << endl;
					return 0;
				}
			}
		}
	}
	cout<<-1<<endl;

	return 0;
}