#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

int n;
vector<int> k;
vector<tuple<int, int, int> > memo;

tuple<int, int, int> solve(bitset<12> bs)
{
    if(get<0>(memo[bs.to_ulong()]) != -2)
        return memo[bs.to_ulong()];

    for(int a=0; a<n; ++a){
        for(int b=a+1; b<n; ++b){
            for(int c=b+1; c<n; ++c){
                if(bs[a] || bs[b] || bs[c])
                    continue;
                if(!((k[a] < k[b] && k[b] > k[c]) || (k[a] > k[b] && k[b] < k[c])))
                    continue;

                bs[a] = bs[b] = bs[c] = true;
                auto x = solve(bs);
                bs[a] = bs[b] = bs[c] = false;

                if(get<0>(x) == -1)
                    return memo[bs.to_ulong()] = make_tuple(a, b, c);
            }
        }
    }

    return memo[bs.to_ulong()] = make_tuple(-1, -1, -1);
}

int main()
{
    cin >> n;
    k.resize(n);
    for(int i=0; i<n; ++i)
        cin >> k[i];

    memo.assign(1<<n, make_tuple(-2, -2, -2));
    auto x = solve(0);
    if(get<0>(x) == -1)
        cout << -1 << endl;
    else
        cout << get<0>(x) << ' ' << get<1>(x) << ' ' << get<2>(x) << endl;

    return 0;
}