#include<bits/stdc++.h>
using namespace std;
using Int = long long;
//INSERT ABOVE HERE
signed main(){
  Int n;
  cin>>n;
  vector<Int> a(n);
  for(Int i=0;i<n;i++) cin>>a[i];

  auto kado=
    [&](Int i,Int j,Int k)->Int{
      if(a[i]==a[j]||a[j]==a[k]||a[k]==a[i]) return 0;
      return (a[i]<a[j]&&a[j]>a[k])||(a[i]>a[j]&&a[j]<a[k]);
    };

  auto calc=
    [&](Int i,Int j,Int k){
      return (1<<i)|(1<<j)|(1<<k);
    };
  
  vector<Int> dp(1<<n,-1);
  function<Int(Int)> dfs=
    [&](Int b)->Int{
      //cout<<bitset<12>(b)<<endl;
      Int &res=dp[b];
      if(~res) return res;
      res=0;
      for(Int i=0;i<n;i++)
	for(Int j=i+1;j<n;j++)
	  for(Int k=j+1;k<n;k++)
	    if(kado(i,j,k)&&!(b&calc(i,j,k)))
	      res|=!dfs(b|calc(i,j,k));
      return res;
    };
  
  for(Int i=0;i<n;i++)
    for(Int j=i+1;j<n;j++)
      for(Int k=j+1;k<n;k++)
	if(kado(i,j,k)&&!dfs(calc(i,j,k)))
	  return cout<<i<<" "<<j<<" "<<k<<endl,0;
  
  cout<<-1<<endl;
  return 0;
}