#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

int N, K[12], dp[1 << 12];
vi kado;

int f(int S){
    int &res = dp[S];
    if(res != -1) return res;

    res = 0;
    each(t, kado)if((S&t)==0){
        res |= 1 - f(S | t);
    }
    return res;
}

int main(){
    cin >> N;
    rep(i, N)cin >> K[i];
    rep(S, 1 << N){
        vi vals;
        rep(i, N)if(S >> i & 1)vals.push_back(K[i]);
        if(sz(vals)==3){
            if((vals[0] != vals[1] && vals[1] != vals[2] && vals[2] != vals[0])){
                int ma = *max_element(all(vals));
                int mi = *min_element(all(vals));
                if(ma == vals[1] || mi == vals[1]){
                    kado.push_back(S);
                }
            }
        }
    }
    MEM(dp, -1);
    vi ans{100,100,100};
    each(S, kado){
        if(!f(S)){
            vi vals;
            rep(i, N)if(S >> i & 1)vals.push_back(i);
            smin(ans, vals);
        }
    }
    if(ans[0] == 100)cout << -1 << endl;
    else{
        rep(i, 3)cout << ans[i] << (i != 2 ? ' ' : '\n');
    }
}