#include <bits/stdc++.h>
using namespace std;

#define int long long
#define rep(i,l,r) for(int i=(int)(l);i<(int)(r);i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
template<class T>bool chmax(T &a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,T b){if(a>b){a=b;return 1;}return 0;}

typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;

const int inf = 1LL<<60;
const int mod = 1e9 + 7;
const double eps = 1e-9;

/*{
}*/

int n, a[12];
int ans[3];

bool dfs(int x)
{
  rep(i, 0, n) rep(j, i+1, n) rep(k, j+1, n){
    if(x & 1<<i or x & 1<<j or x & 1<<k) continue;
    if((a[i]-a[j])*(a[k]-a[j]) > 0){
      if(!dfs(x | 1<<i | 1<<j | 1<<k)){
        ans[0] = i; ans[1] = j; ans[2] = k;
        return true;
      }
    }
  }
  return false;
}

signed main()
{
  cin >> n;
  rep(i, 0, n) cin >> a[i];

  if(dfs(0)) cout << ans[0] << " " << ans[1] << " " << ans[2] << endl;
  else cout << -1 << endl;

  return 0;
}