#include <iostream>
#include <vector>
#include <algorithm>
#include <limits.h>

struct Answer {
    int n1, n2, n3, level;
};

std::vector<Answer> ans;

int player_e(std::vector<int> &k, int level);

int player_d(std::vector<int> &k, int level);

int check(int a, int b, int c)
{
    if (a > b && a < c) return 1;
    if (a > c && a < b) return 1;
    if (c > b && c < a) return 1;
    if (c > a && c < b) return 1;
    return 0;
}

int player_e(std::vector<int> &k, int level)
{
    int lv = level;
    for (int n1 = 0; n1 < k.size(); n1++) {
        for (int n2 = n1 + 1; n2 < k.size(); n2++) {
            for (int n3 = n2 + 1; n3 < k.size(); n3++) {
                if (check(k[n1], k[n2], k[n3]) != 0) {
                    std::vector<int> t = k;
                    t.erase(t.begin() + n3);
                    t.erase(t.begin() + n2);
                    t.erase(t.begin() + n1);
                    if (t.size() == 0) {
                        return -1; // win
                    }
                    int rc = player_d(t, level+1);
                    if (rc == -1) {
                        return -1; // win
                    }
                    if (lv < rc) {
                        lv = rc;
                    }
                }
            }
        }
    }
    return lv;
}

int player_d(std::vector<int> &k, int level)
{
    int lv = INT_MAX;
    int detect = 0;
    for (int n1 = 0; n1 < k.size(); n1++) {
        for (int n2 = n1 + 1; n2 < k.size(); n2++) {
            for (int n3 = n2 + 1; n3 < k.size(); n3++) {
                if (check(k[n1], k[n2], k[n3]) != 0) {
                    std::vector<int> t = k;
                    t.erase(t.begin() + n3);
                    t.erase(t.begin() + n2);
                    t.erase(t.begin() + n1);
                    int rc = player_e(t, level+1);
                    if (rc < 0) {
                        continue;
                    }
                    if (lv < rc) {
                        lv = rc;
                    }
                    detect = 1;
                    if (level == 0) {
                        Answer a = { n1, n2, n3, rc, };
                        ans.push_back(a);
                    }
                }
            }
        }
    }
    if (detect == 0) {
        return -1;
    }
    return lv;
}

int main()
{
    int N;
    std::vector<int> k;

    std::cin >> N;
    k.resize(N);
    for (int n = 0; n < N; n++) {
        std::cin >> k[n];
    }
    player_d(k, 0);
    if (ans.size() > 0) {
        Answer &a = ans[0];
        for (int n = 1; n < ans.size(); n++) {
            if (a.level > ans[n].level) {
                a = ans[n];
            }
        }
        std::cout << a.n1 << " ";
        std::cout << a.n2 << " ";
        std::cout << a.n3 << std::endl;
    }
    else {
        std::cout << -1 << std::endl;
    }
    return 0;
}