#include <iostream>
#include <algorithm>
using namespace std;

bool isKadomatsu(int a, int b, int c)
{
    return b>a and b>c or b<a and b<c;
}

bool win(const vector<int>& a, int mask)
{
    int n=a.size();
    bool res=true;
#define REP(i, a, b) for(int i=a;i<b;++i)
    REP(i, 0, n) REP(j, i+1, n) REP(k, j+1, n) {
        int m=mask&~((1<<i)|(1<<j)|(1<<k));
        if ((mask&(1<<i)) and (mask&(1<<j)) and (mask&(1<<k)) and isKadomatsu(a[i], a[j], a[k]))
            res=res and !win(a, m);
    }
    return res;
}

int main()
{
    int n; cin>>n;
    vector<int> a(n); for(int& v: a) cin>>v;
    REP(i, 0, n) REP(j, i+1, n) REP(k, j+1, n) {
        if (isKadomatsu(a[i], a[j], a[k])) {
            if (win(a, ((1<<n)-1)^(1<<i)^(1<<j)^(1<<k))) {
                cout<<i<<' '<<j<<' '<<k<<endl;
                return 0;
            }
        }
    }
    cout<<-1<<endl;
}