#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int n;
int dp[1<<20];
int keep[1<<20][3];
int a[50];

void dfs(int x){
    bitset<30> f(x);
    dp[x] = -1;
    rep(i,n){
        if(f[i]==0)continue;
        srep(j,i+1,n){
            if(f[j]==0)continue;
            srep(k,j+1,n){
                if(f[k]==0)continue;

                if(a[i]==a[j]||a[j]==a[k]||a[k]==a[i])continue;
                if(a[i]<a[j]&&a[j]<a[k])continue;
                if(a[i]>a[j]&&a[j]>a[k])continue;

                int y = x - (1<<i) - (1<<j) - (1<<k);
                if(dp[y] == 0) dfs(y);
                if(dp[y] == -1){
                    dp[x] = 1;
                    keep[x][0] = i;
                    keep[x][1] = j;
                    keep[x][2] = k;
                    break;
                }
            }
            if(dp[x] == 1)break;
        }
        if(dp[x] == 1)break;
    }
}

int main() {
    cin >> n;
    rep(i,n)cin >> a[i];

    dfs((1<<n)-1);

    if(dp[(1<<n)-1] == -1){
        cout << -1 << endl;
    }else{
        rep(j,3){
            cout << keep[(1<<n)-1][j];
            if(j == 2) cout << endl;
            else cout << ' ';
        }
    }
    return 0;
}