#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <queue>
using namespace std;
typedef long long int ll;
const int INF = 100000000;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int k[21];
int dp[21];
vector <int> s;
int main(){
    int n, lis=-1;
    int mlis = -1;
    cin >> n;
    rep(i,n) cin >> k[i];
    rep(i,n) {
        dp[i] = 1;
        rep(j,i){
            if(k[j] < k[i]){
                dp[i] = max(dp[i], dp[j]+1);
                s.push_back(i);
            }
        }
        lis = max(lis,dp[i]);
    }
    int a = (n-lis) /3;
    if(a%2==0 && a>= 3){
        cout << "-1" <<endl;
        return 0;
    }
    int f = n-lis;
    rep(i,n-2) {
        for(int j=i+1;j<n-1;j++){
            for(int h=j+1;h<n;h++){
                if(k[i] < k[j] && k[j] < k[h]) break;
                if(k[i] > k[j] && k[j] > k[h]) break;
                cout << i << " "<< j << " " << k << endl;
                return 0;
            }
        }
    }
}