#include <iostream>
using namespace std;

int n;
int h[12];
bool del[12];

int negamax(){
	int i, j, k;
	int ans = -1;
	for( i = 0; i < n; i++ ){
		for( j = i + 1; j < n; j++ ){
			for( k = j + 1; k < n; k++ ){
				if( h[i] != h[k] && (h[j] < min(h[i], h[k]) || h[j] > max(h[i], h[k])) ){
					if( !del[i] && !del[j] && !del[k] ){
						del[i] = del[j] = del[k] = true;
						ans = max(ans, -negamax());
						del[i] = del[j] = del[k] = false;
					}
				}
			}
		}
	}
	return ans;
}

int main(){
	cin >> n;
	for( int i = 0; i < n; i++ )
		cin >> h[i];
	
	int i, j, k;
	int ans = -1;
	for( i = 0; i < n; i++ ){
		for( j = i + 1; j < n; j++ ){
			for( k = j + 1; k < n; k++ ){
				if( h[i] != h[k] && (h[j] < min(h[i], h[k]) || h[j] > max(h[i], h[k])) ){
					if( !del[i] && !del[j] && !del[k] ){
						del[i] = del[j] = del[k] = true;
						if( -negamax() > 0 ){
							cout << i << " " << j << " " << k << endl;
							return 0;
						}
						del[i] = del[j] = del[k] = false;
					}
				}
			}
		}
	}
	cout << -1 << endl;
	return 0;
}