#include "bits/stdc++.h"
#define REP(i,n,N) for(int i=(n); i<(N); i++)
#define RREP(i,n,N) for(int i=(N-1); i>=n; i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define ALL(v) (v).begin(),(v).end()
#define p(s) cout<<(s)<<endl
#define p2(a,b) cout<<(a)<<" "<<(b)<<endl
typedef long long ll;
using namespace std;
const int inf=1e9;

int N;
vector<int> K;
bool dfs(int mask, int turn){//turn=0: gote
    REP(i,0,N-2) {
        if(mask & (1<<i)) continue;
        REP(j, i + 1, N - 1) {
            if(mask & (1<<j)) continue;
            if (K[i] == K[j]) continue;
            REP(k, j + 1, N) {
                if(mask & (1<<k)) continue;
                if (K[i] == K[k] || K[j] == K[k]) continue;
                if (K[i] > K[j] && K[j] > K[k]) continue;
                if (K[i] < K[j] && K[j] < K[k]) continue;
                if (dfs(mask | (1 << i) | (1 << j) | (1 << k), 1-turn)==turn) {
                    return turn;
                }
            }
        }
    }
    return 1-turn;
}

int main(){
    cin>>N;
    REP(i,0,N){
        int k;
        cin>>k;
        K.push_back(k);
    }
    REP(i,0,N-2){
        REP(j,i+1,N-1){
            if(K[i]==K[j]) continue;
            REP(k,j+1,N){
                if(K[i]==K[k]||K[j]==K[k]) continue;
                if(K[i]>K[j]&&K[j]>K[k]) continue;
                if(K[i]<K[j]&&K[j]<K[k]) continue;
                if(dfs((1<<i)|(1<<j)|(1<<k),0)){
                    cout<<i<<" "<<j<<" "<<k<<endl;
                    return 0;
                }
            }
        }
    }
    p(-1);
    return 0;
}