#include<iostream>
#include<vector>
#include<algorithm>

bool kadomatsu[12][12][12];

void makeKadomatsu(std::vector<int> v){
    for(int i = 0;i < v.size() - 2; ++i){
        for(int j = i + 1; j < v.size() - 1; ++j){
            if(v[i] == v[j]){
                for(int k = 0; k < v.size(); ++k) kadomatsu[i][j][k] = false;
                continue;
            }
            for(int k = j + 1; k < v.size(); ++k){
                if((v[i] < v[j] && v[j] < v[k]) || v[i] == v[k] || v[j] == v[k]){
                    kadomatsu[i][j][k] = false;
                }else{
                    kadomatsu[i][j][k] = true;
                }
            }
        }
    }
}

void showvector(std::vector<int> v){
    for(int i = 0; i < v.size(); ++i){
        if(v[i] != 0){
            std::cout << v[i] << " ";
        }
    }
    std::cout << std::endl;
}

bool remaining_kadomatsu_array(std::vector<int> v){
    if(v.size() - std::count(v.begin(), v.end(), 0) < 3) return false;
    for(int i = 0; i < v.size() - 2; ++i){
        for(int j = i + 1; j < v.size() - 1; ++j){
            for(int k = j + 1; k < v.size(); ++k){
                if(kadomatsu[i][j][k] == true) return true;
            }
        }
    }
    return false;
}

bool dfs(std::vector<int> v, int turn){
    // if turn is even -> player's turn.
    if(remaining_kadomatsu_array(v) == false){
        if(turn % 2 == 0){
            return false;
        }else{
            return true;
        }
    }
    std::vector<bool> result;
    for(int i = 0; i < v.size() - 2; ++i){
        if(v[i] == 0) continue; // 使用済みならパス
        int a = v[i];
        v[i] = 0;
        for(int j = i + 1; j < v.size() - 1; ++j){
            if(v[j] == 0) continue; // 使用済みならパス
            int b = v[j];
            v[j] = 0;
            for(int k = j + 1; k < v.size(); ++k){
                if(kadomatsu[i][j][k] == false) continue; // 門松列を作れない
                if(v[k] == 0) continue; // 使用済みならパス
                int c = v[k];
                v[k] = 0;
                result.push_back(dfs(v, turn + 1));
                v[k] = c;
                if(turn % 2 == 0 && result.back() == true) return true;
            }
            v[j] = b;
        }
        v[i] = a;
    }
    if(turn % 2 == 1 && std::find(result.begin(), result.end(), false) == result.end()){
        return true;
    }else{
        return false;
    }
}

int main(){
    int n;
    std::cin >> n;

    std::vector<int> v(n);
    for(int i = 0; i < n; ++i){
        std::cin >> v[i];
    }
    makeKadomatsu(v);

    for(int i = 0; i < n - 2; ++i){
        int a = v[i];
        for(int j = i + 1; j < n - 1; ++j){
            int b = v[j];
            for(int k = j + 1; k < n; ++k){
                if(kadomatsu[i][j][k] == false) continue;
                int c = v[k];
                v[i] = v[j] = v[k] = 0;
                if(dfs(v, 1) == true){
                    std::cout << i << " " << j << " " << k << std::endl;
                    return 0;
                }
                v[k] = c;
            }
            v[j] = b;
        }
        v[i] = a;
    }
    std::cout << -1 << std::endl;
    return 0;
}