#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9+7;    
int N;
vector<int> K,used;
bool dfs(int depth){

    //rep(i,0,N)cout << used[i] << " \n"[i==N-1];
    bool iswin = 0;
    int a = -1,b,c;
    rep(i,0,N)rep(j,i+1,N)rep(k,j+1,N){
        if(K[i] == K[j] || K[j] == K[k] || K[k] == K[i])continue;
        if(K[j] != max({K[i], K[j], K[k]}) && K[j] != min({K[i], K[j], K[k]}))continue;
        if(used[i] == 1|| used[j] == 1|| used[k] == 1)continue;
        used[i] = used[j] = used[k] = 1; 
        bool f = !dfs(depth + 1);
        iswin |= f;
        if(f && a == -1){
            a = i,b = j,c = k;
        }
        used[i] = used[j] = used[k] = 0;
    }
    if(depth == 0){
        if(iswin)cout << a << " " << b << " " << c << endl;
        else    cout << -1 << endl;
    }
    return iswin;
}
main(){
    cin >> N;
    K.resize(N),used.resize(N);
    rep(i,0,N)cin >> K[i];
    dfs(0);
    //勝ちならtrue
    //if(dfs(0))cout << "win" << endl;
    //else cout << "lose" << endl;
}