#include<bits/stdc++.h>
using lint=long long;
int main(){
    std::cin.tie(nullptr);std::ios_base::sync_with_stdio(false);
    std::cout.setf(std::ios_base::fixed);std::cout.precision(15);
    lint n;std::cin>>n;
    lint N=1ll<<n;
    std::vector<lint>a(n);
    for(lint&x:a)std::cin>>x;
    std::vector<lint>dp(N);
    for(lint bs=0;bs<N;bs++){
        bool found=false;
        for(lint i=0;i<n;i++)if(bs>>i&1){
            for(lint j=i+1;j<n;j++)if(bs>>j&1){
                for(lint k=j+1;k<n;k++)if(bs>>k&1){
                    if(a.at(i)!=a.at(k)
                        &&(a.at(i)-a.at(j))*(a.at(k)-a.at(j))>0
                        &&!dp.at(bs^1ll<<i^1ll<<j^1ll<<k))
                    {
                        dp.at(bs)=(i<<8)+(j<<4)+k;
                        found=true;
                        break;
                    }
                }
                if(found)break;
            }
            if(found)break;
        }
    }
    lint ans=dp.at(N-1);
    if(!ans){
        std::cout<<-1<<'\n';
    }else{
        lint i=ans>>8&15;
        lint j=ans>>4&15;
        lint k=ans&15;
        std::cout<<i<<" "<<j<<" "<<k<<'\n';
    }
}