#include <bits/stdc++.h>

using namespace std;

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

const double PI = acos(-1);

bool check(int a, int b, int c) {
  if (a == b || b == c || c == a) return false;
  return b == max({a, b, c}) || b == min({a, b, c});
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n;
  cin >> n;
  vector<int> a(n);
  REP (i, n) cin >> a[i];

  vector<bool> win(1<<n);

  REP (mask, 1<<n) {
    REP (i, n) FOR (j, i+1, n) FOR (k, j+1, n) {
      int nask = 1 << i | 1 << j | 1 << k;
      if ((mask & nask) != nask) continue;
      if (check(a[i], a[j], a[k])) {
        if (!win[mask & ~nask])
          win[mask] = true;
      }
    }
  }

  if (!win.back())
    cout << -1 << endl;

  int all = 1<<n;
  --all;
  REP (i, n) FOR (j, i+1, n) FOR (k, j+1, n) {
    int nask = 1 << i | 1 << j | 1 << k;
    if (check(a[i], a[j], a[k]) && !win[all & ~nask]) {
      cout << i << " " << j << " " << k << endl;
      exit(0);
    }
  }
  
  return 0;
}