#include<iostream>
#include<algorithm>

using namespace std;

#define NMAX 12

int N,K[NMAX];

int D_turn(int f);
int E_turn();

bool judge(int a,int b,int c){
	return a!=-1&&b!=-1&&c!=-1&&a!=b&&a!=c&&b!=c&&(min(a,min(b,c))==b||max(a,max(b,c))==b);
}

int E_turn(){
	/*cout<<"E: ";
	for(int i=0;i<N;i++) cout<<K[i]<<" ";
	cout<<endl;*/
	int wl;
	for(int i=0;i<N;i++){
		for(int j=i+1;j<N;j++){
			for(int k=j+1;k<N;k++){
				if(judge(K[i],K[j],K[k])){
					int ki=K[i],kj=K[j],kk=K[k];
					K[i]=-1,K[j]=-1,K[k]=-1;
					wl=D_turn(0);
					K[i]=ki,K[j]=kj,K[k]=kk;
					if(wl==-1) return 1;
				}
			}
		}
	}
	//cout<<"E:LOSE"<<endl;
	return -1;
}


int D_turn(int f){
	/*cout<<"D: ";
	for(int i=0;i<N;i++) cout<<K[i]<<" ";
	cout<<endl;*/
	int wl=-1;
	for(int i=0;i<N;i++){
		for(int j=i+1;j<N;j++){
			for(int k=j+1;k<N;k++){
				if(judge(K[i],K[j],K[k])){
					int ki=K[i],kj=K[j],kk=K[k];
					K[i]=-1,K[j]=-1,K[k]=-1;
					wl=E_turn();
					K[i]=ki,K[j]=kj,K[k]=kk;
					if(wl==-1&&f==1){
						cout<<i<<" "<<j<<" "<<k<<endl;
						return 1;
					}
					if(wl==-1) return 1;		
				}
			}
		}
	}
	//cout<<",D_LOSE"<<endl;
	return -1;
}

int main(){

	cin>>N;

	for(int i=0;i<N;i++){
		cin>>K[i];
	}

	if(D_turn(1)==-1) cout<<"-1"<<endl;
}