import java.awt.Frame;
import java.net.NetworkInterface;
import java.util.*;

public class Main {
	static long gcd(long a,long b){
		return b == 0 ? a : gcd(b, a%b);
	}
	static long lcm(long a, long b){
		return a*b/gcd(a, b);
	}
	static int[] dx = {0,1,0,-1};//→↓←↑
	static int[] dy = {1,0,-1,0};
	static class Pair{
		long weight,value;
		public Pair(long weight,long value) {
			// TODO Auto-generated constructor stub
			this.weight = weight;
			this.value = value;
		}
	}
	static boolean is_kadomatsu(int a,int b, int c){
		if(a==b || b==c || a==c) return false;
		if( (a<b && b<c) || (a>b && b>c) )return false;
		return true;
	}
	
	static boolean dfs(int used,int now){ //勝ちでtrue
		if( (n-Integer.bitCount(used))<3) return false;
		boolean win = false;
		for(int i=0;i<n;i++){
			for(int j=i+1;j<n;j++){
				for(int k=j+1;k<n;k++){
					if( ((used>>i)&1)==0 && ((used>>j)&1)==0 && ((used>>k)&1)==0 ){
						if(is_kadomatsu(kado[i], kado[j], kado[k])){
							if(dfs(used+(1<<i)+(1<<j)+(1<<k),now+1)){
								continue;
							}
							if(now==0)System.out.println(i+" "+j+" "+k);
							return true;
						}
					}
				}
			}
		}
		return win;
	}
	static int n;
	static int[] kado;
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		n = sc.nextInt();
		kado = new int[n];
		for(int i=0;i<n;i++) kado[i] = sc.nextInt();
		if(!dfs(0,0))		System.out.println(-1);
	}
}