#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;


int N;
vector<int> A;
int Used = 0;
int best[3] = {-1,-1,-1};

void print() {
    for ( int i = 0; i < N; i++ ) {
        cout << ( Used&(1<<i) ? "1" : "0" );
    }
    cout << endl;
}

bool isKadomatsu( int a, int b, int c ) {
    return ( a < b && b > c && a != c ) || ( a > b && b < c && a != c );
}

int func() {
    // print();

    int win = 0;

    vector<int> X;
    for ( int i = 0; i < N; i++ ) {
        if ( (Used&(1<<i)) == 0 ) { X.push_back(i); }
    }
    for ( int i = 0; i < X.size(); i++ ) {
    for ( int j = i+1; j < X.size(); j++ ) {
    for ( int k = j+1; k < X.size(); k++ ) {
        int t = Used;
        if ( isKadomatsu( A[X[i]], A[X[j]], A[X[k]] ) ) {
            // cout << A[X[i]] << " " << A[X[j]] << " " << A[X[k]] << endl;
            Used |= (1<<X[i]) | (1<<X[j]) | (1<<X[k]);
            if ( func() == 0 ) {
                best[0] = X[i];
                best[1] = X[j];
                best[2] = X[k];
                Used = t;
                return 1;
            } 
        }
        Used = t;
    }
    }
    }

    return 0;
}

int main() {
    
    cin >> N;
    A.resize(N);
    for ( int i = 0; i < N; i++ ) {
        cin >> A[i];
    }

    if ( func() ) {
        cout << best[0] << " " << best[1] << " " << best[2] << endl;
    }
    else { cout << -1 << endl; }


    return 0;
}