#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <string>
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define var auto
#define mod 1000000007
#define inf 2147483647
#define mp make_pair
#define pb push_back
typedef long long ll;
using namespace std;

template <typename T>
inline void output(T a, int p) {
    if(p){
        cout << fixed << setprecision(p)  << a << "\n";
    }
    else{
        cout << a << "\n";
    }
}
// end of template

bool isKadomatsu(int a, int b, int c){
    if ((a < b && b > c) || (a > b && b < c)) return true;
    return false;
}

class kado{
public:
    vector<int> ret;
    vector<int> K;
    int sz;
    
    kado(vector<int> K){
        sz = (int)K.size();
        this -> K = K;
        ret.assign(3, 0);
    }
    
    bool battle(){
        rep(i, sz){
            repd(j, i + 1, sz){
                repd(k, j + 1, sz){
                    int a = K[i], b = K[j], c = K[k];
                    if (a == 0 || b == 0 || c == 0) {
                        continue;
                    }
                    if (!isKadomatsu(a, b, c)) {
                        continue;
                    }
                    K[i] = 0, K[j] = 0, K[k] = 0;
                    bool r = battle();
                    K[i] = a, K[j] = b, K[k] = c;
                    if (!r) {
                        ret[0] = i, ret[1] = j, ret[2] = k;
                        return true;
                    }
                }
            }
        }
        return false;
    }
    
};






int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    // source code
    int N;
    cin >> N;
    vector<int> K(N);
    rep(i, N){
        cin >> K[i];
    }
    
    kado kad(K);
    
    if (kad.battle()) {
        cout << kad.ret[0] << " " << kad.ret[1] << " " << kad.ret[2] << endl;
    }
    else{
        output(-1, 0);
    }
    
    
    
    return 0;
}