#include <bits/stdc++.h>

#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()

using namespace std;

int N, a[16];

tuple<bool,int,int,int> dp(int bit) {
  for (int i = 0; i < N; ++i)
    if ((bit >> i) & 1)
      for (int j = i+1; j < N; ++j)
        if ((bit >> j) & 1)
          for (int k = j+1; k < N; ++k)
            if ((bit >> k) & 1) {
              int nbit = bit & ~(1 << i) & ~(1 << j) & ~(1 << k);
              if (!get<0>(dp(nbit)) &&
                  ((a[i] > a[j] && a[j] < a[k]) ||
                   (a[i] < a[j] && a[j] > a[k])))
                return make_tuple(true, i, j, k);
            }
  return make_tuple(false, 0, 0, 0);
}

int main() {
  cin >> N;
  REP(i,N) cin >> a[i];
  bool res; int i, j, k;
  tie(res, i, j, k) = dp((1 << N) - 1);
  if (res) cout << i << " " << j << " " << k << endl;
  else cout << -1 << endl;
  return 0;
}