#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
    int n;
    cin >> n;
    vector<int> dp(1 << n), a(n);
    for(auto &&v:a)cin >> v;
    vector<bool> A(1 << n);
    for(int i = 0; i < n; i++){
        for(int j = 0; j < i; j++){
            for(int k = 0; k < j; k++){
                if(a[i] != a[k]){
                    if(a[j] < a[i] && a[j] < a[k])A[(1 << i) | (1 << j) | (1 << k)] = true;
                    if(a[j] > a[i] && a[j] > a[k])A[(1 << i) | (1 << j) | (1 << k)] = true;
                }
            }
        }
    }
    for(int i = 0; i < (1 << n); i++){
        if(__builtin_popcount(i) <= 2)continue;
        vector<int> b;
        for(int j = i; j > 0; j = (j - 1) & i){
            if(A[j])b.push_back(dp[i ^ j]);
        }
        sort(b.begin(), b.end());
        int v = 0;
        while(binary_search(b.begin(), b.end(), v))v++;
        dp[i] = v;
    }
    if(dp.back() == 0){
        cout << -1 << endl;
        return 0;
    }
    int S = (1 << n) - 1;
    vector<vector<int>> b;
    for(int j = S; j > 0; j = (j - 1) & S){
        if(A[j] && dp[S ^ j] == 0){
            b.push_back({});
            for(int k = 0; k < n; k++){
                if(j >> k & 1)b.back().push_back(k);
            }
        }
    }
    sort(b.begin(), b.end());
    for(int i = 0; i < 3; i++){
        if(i)cout << " ";
        cout << b[0][i];
    }
    cout << '\n';
}