import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


bool isKadomatsu(int a, int b, int c) {
  return ((a < b && b > c || a > b && b < c) && a != c);
}

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto K = new int[N];
      foreach (i; 0 .. N) {
        K[i] = readInt();
      }
      
      auto dp = new bool[1 << N];
      foreach (p; 0 .. 1 << N) {
        foreach (i; 0 .. N) foreach (j; i + 1 .. N) foreach (k; j + 1 .. N) {
          if ((p & 1 << i) && (p & 1 << j) && (p & 1 << k)) {
            if (isKadomatsu(K[i], K[j], K[k])) {
              if (!dp[p ^ 1 << i ^ 1 << j ^ 1 << k]) {
                dp[p] = true;
              }
            }
          }
        }
      }
      if (dp[$ - 1]) {
        foreach (i; 0 .. N) foreach (j; i + 1 .. N) foreach (k; j + 1 .. N) {
          if (isKadomatsu(K[i], K[j], K[k])) {
            if (!dp[((1 << N) - 1) ^ 1 << i ^ 1 << j ^ 1 << k]) {
              writeln(i, " ", j, " ", k);
              goto found;
            }
          }
        }
        assert(false);
       found:
      } else {
        writeln(-1);
      }
    }
  } catch (EOFException e) {
  }
}