package yukicoder;
import java.util.Arrays;
import java.util.Scanner;
public class Main{
	public static void main(String[] args)throws Exception{
		new Main().solve();
	}
	void solve(){
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		int[] k=new int[n];
		for(int i=0;i<n;i++)k[i]=sc.nextInt();
		if(judge(k)){
			System.out.println(ans[0]+" "+ans[1]+" "+ans[2]);
		}else{
			System.out.println(-1);
		}
	}
	int[] ans=new int[3];
	boolean judge(int[] k){
		int n=k.length;
		for(int i=0;i<n;i++){
			for(int j=i+1;j<n;j++){
				for(int l=j+1;l<n;l++){
					if(isKadomatsu(k[i],k[j],k[l])){
						int[] d=Arrays.copyOf(k, k.length);
						d[i]=d[j]=d[l]=-1;
						if(!judge(d)){
							ans[0]=i;
							ans[1]=j;
							ans[2]=l;
							return true;
						}
					}
				}
			}
		}
		return false;
	}
	
	
	boolean isKadomatsu(int x,int y,int z){
		if(x==-1||y==-1||z==-1)return false;
		else if(x==y||y==z||z==x)return false;
		else if(x<y&&y>z)return true;
		else if(x>y&&z>y)return true;
		else return false;
	}
}