import java.util.Arrays;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.Set;

public class Main {
	
	public static boolean dfs(final int deep, final int N, int[] array, int used, boolean[] visited, boolean[] memo){
		if(visited[used]){
			return memo[used];
		}
		visited[used] = true;
		
		for(int fst = 0; fst < N; fst++){
			if((used & (1 << fst)) != 0){ continue; }
			
			for(int snd = fst + 1; snd < N; snd++){
				if((used & (1 << snd)) != 0){ continue; }
				if(array[fst] == array[snd]){ continue; }
				
				for(int thd = snd + 1; thd < N; thd++){
					if((used & (1 << thd)) != 0){ continue; }
					if(array[fst] == array[thd]){ continue; }
					if(array[snd] == array[thd]){ continue; }
					if(array[fst] < array[snd] && array[snd] < array[thd]){ continue; }
					if(array[fst] > array[snd] && array[snd] > array[thd]){ continue; }
					
					if(!dfs(deep + 1, N, array, used | (1 << fst) | (1 << snd) | (1 << thd), visited, memo)){
						if(deep == 0){
							System.out.println(fst + " " + snd + " " + thd);
						}
						return memo[used] = true;
					}
				}
			}
		}
		
		return memo[used] = false;
	}
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		final int N = sc.nextInt();
		
		int[] array = new int[N];
		for(int i = 0; i < N; i++){
			array[i] = sc.nextInt();
		}
		
		final boolean ret = dfs(0, N, array, 0, new boolean[1 << N], new boolean[1 << N]);
		if(!ret){ System.out.println(-1); }
		
	}

}