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

//#define int long long

typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
template<class T,class U>void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>void chmax(T &t,U f){if(t<f)t=f;}

int N;
int K[12];

int dp[1<<12];
bool dfs(int b){
    if(dp[b]!=-1)return dp[b];
    int cnt=0;
    rep(i,N)if(b>>i&1)cnt++;
    bool ret;
    int p=(cnt/3)&1;
    if(!p){
        ret=false;
        rep(i,N)reps(j,i+1,N)reps(k,j+1,N){
            if(b>>i&1)continue;
            if(b>>j&1)continue;
            if(b>>k&1)continue;
            if(K[i]==K[j]||K[j]==K[k]||K[k]==K[i])continue;
            if(max(max(K[i],K[j]),K[k])!=K[j]&&min(min(K[i],K[j]),K[k])!=K[j])continue;
            int bb=b|(1<<i)|(1<<j)|(1<<k);
            if(dfs(bb))ret=true;
        }
    }
    else{
        ret=true;
        rep(i,N)reps(j,i+1,N)reps(k,j+1,N){
            if(b>>i&1)continue;
            if(b>>j&1)continue;
            if(b>>k&1)continue;

            if(K[i]==K[j]||K[j]==K[k]||K[k]==K[i])continue;
            if(max(max(K[i],K[j]),K[k])!=K[j]&&min(min(K[i],K[j]),K[k])!=K[j])continue;
            int bb=b|(1<<i)|(1<<j)|(1<<k);
            if(!dfs(bb))ret=false;
        }
    }
    return dp[b]=ret;
}

signed main(){
    cin>>N;rep(i,N)cin>>K[i];
    memset(dp,-1,sizeof(dp));
    if(!dfs(0))puts("-1");

    rep(i,N)reps(j,i+1,N)reps(k,j+1,N){
        int b=(1<<i)|(1<<j)|(1<<k);
        if(dp[b]==1){
            cout<<i<<" "<<j<<" "<<k<<endl;
            return 0;
        }
    }
    return 0;
}