#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define repp(i, n) rep(i, n)
#define reppp(i, n) repp(i, n)
#define rrepp(i, n) rrep(i, n)
#define repss(i, n) reps(i, n)
#define repcc(i, n) repc(i, n)
#define repii(i, a, b) repi(i, a, b)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))

using namespace std;

using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vu64 = vector<u64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
inline u64 xorshift() { static u64 x = 88172645463325252ull; x = x ^ (x << 7); return x = x ^ (x >> 9); }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T power(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
template <typename T, typename S> istream& operator>>(istream &is, pair<T, S> &p) { is >> p.first >> p.second; return is; }
template <typename T, typename S> ostream& operator<<(ostream &os, pair<T, S> &p) { os << p.first << ' ' << p.second; return os; }

void solve() {
  int N; cin >> N;
  vi32 K(N); cin >> K;
  vector<bool> b(N);
  
  auto check = [&](int i, int j, int k) {
    if (b[i] || b[j] || b[k]) return false;
    if (K[i] == K[j] || K[j] == K[k] || K[k] == K[i]) return false;
    if (K[i] > K[j] && K[j] < K[k]) {
      return true;
    } else if (K[i] < K[j] && K[j] > K[k]) {
      return true;
    }
    return false;
  };

  function<bool()> rec = [&]() {
    bool f = false;
    rep(k, N) rep(j, k) rep(i, j) {
      if (!check(i, j, k)) continue;
      b[i] = b[j] = b[k] = true;
      bool r = rec();
      b[i] = b[j] = b[k] = false;
      if (!r) f = true;
    }
    return f;
  };
  
  vi32 v(N, 1);
  v[0] = v[1] = v[2] = 0;
  do {
    vi32 l;
    rep(i, N) if (v[i] == 0) l.push_back(i);
    if (!check(l[0], l[1], l[2])) continue;
    b[l[0]] = b[l[1]] = b[l[2]] = true;
    if (!rec()) {
      cout << l[0] << " " << l[1] << " " << l[2] << '\n';
      return;
    }
    b[l[0]] = b[l[1]] = b[l[2]] = false;
  } while (next_permutation(all(v)));
  cout << -1 << '\n';
}