#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

bool is_katomatsu(int x, int y, int z) {
  if (x == y || y == z || z == x) return false;
  return max({x, y, z}) == y || min({x, y, z}) == y;
}

int main() {
  int n; cin >> n;
  vector<int> k(n); REP(i, n) cin >> k[i];
  vector<vector<bool> > dp(1 << n, vector<bool>(2, false));
  for (int i = (1 << n) - 1; i >= 0; --i) REP(j, 2) {
    REP(x, n) {
      if (i >> x & 1) continue;
      FOR(y, x + 1, n) {
        if (i >> y & 1) continue;
        FOR(z, y + 1, n) {
          if (i >> z & 1) continue;
          if (is_katomatsu(k[x], k[y], k[z]) && !dp[i | (1 << x) | (1 << y) | (1 << z)][j ^ 1]) {
            dp[i][j] = true;
            if (i == 0 && j == 0) {
              cout << x << ' ' << y << ' ' << z << '\n';
              return 0;
            }
          }
        }
      }
    }
  }
  cout << "-1\n";
  return 0;
}