#include <bits/stdc++.h>
#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<list>
#include<queue>
#include<math.h>
#include<bitset>
using ll = long long;
using namespace std;

int n;
vector<int> dp(10000, -1), A(12);

bool kado(int a, int b, int c){
    if (a == b || b == c || c == a) return 0;
    else if (a < b && b > c) return 1;
    else if (a > b && b < c) return 1;
    else return 0;
}

bool dfs(int bitnum){
    if (dp[bitnum] >= 0) return dp[bitnum];
    for (int i = 0; i < n; i++){
        for (int j = i+1; j < n; j++){
            for (int k = j+1; k < n; k++){
                int bitsum = (1<<i) + (1<<j) + (1<<k);
                if (!kado(A[i], A[j], A[k])) continue;
                if ((~bitnum&1<<i) && (~bitnum&1<<j) && (~bitnum&1<<k) && !dfs(bitnum^bitsum)){
                    return dp[bitnum] = 1;
                }
            }
        }
    }
    return dp[bitnum] = 0;
}

int main(){
    cin >> n;
    for (int i = 0; i < n; i++) cin >> A[i];

    for (int i = 0; i < n; i++){
        for (int j = i+1; j < n; j++){
            for (int k = j+1; k < n; k++){
                int bitsum = (1<<i) + (1<<j) + (1<<k);
                if (!kado(A[i], A[j], A[k])) continue;
                if (!dfs(bitsum)){
                    cout << i << " " << j << " " << k << endl;
                    return 0;
                }
            }
        }
    }

    cout << -1 << endl;
}