#include "bits/stdc++.h"

#define rep(i,n) for(int i = 0;i < n;i++)
#define REP(i,n,k) for(int i = n;i < k;i++)
#define P(p) cout << (p) << endl;
#define sP(p) cout << setprecision(15) << fixed << p << endl;
#define pi 3.1415926535
#define IINF 1e9
#define LINF 1e18
#define vi vector<int>
#define mp make_pair
#define max(a,b,c) max(a,max(b,c))
#define min(a,b,c) min(a,min(b,c))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int dx[] = { 0, 1, 0, -1 };
int dy[] = { -1, 0, 1, 0 };

unsigned long long sttoi(std::string str) {
    unsigned long long ret;
    std::stringstream ss; ss << str;
    ss >> ret;
    return ret;
}

ull gcd(ull a, ull b){
    if (b > a)swap(a, b);
    if (b == 0) return a;
    return gcd(b, a%b);
}
bool isKadomatsu(int a,int b,int c){
  if(a == b || b == c || c == a){
    return false;
  }
  if(max(a,b,c) == b || min(a,b,c) == b){
    return true;
  }
  return false;
}
int n;
vi K(15);
int memo[10000];
//player : D = 1, E = 2
int game(int b){
  int res = 0;
  if(memo[b] != -1) return memo[b];
  rep(i,n)REP(j,i+1,n)REP(k,j+1,n){
    if((b&1<<i)&&(b&1<<j)&&(b&1<<k)){
      if(isKadomatsu(K[i],K[j],K[k])){
        if(game(b^(1<<i)^(1<<j)^(1<<k))==0) res = 1;
      }
    }
  }
  return memo[b] = res;
}

void solve() {
  cin >> n;
  rep(i,n){
    cin >> K[i];
  }
  rep(i,1<<n){
    memo[i] = -1;
  }
  rep(i,n)REP(j,i+1,n)REP(k,j+1,n){
    if(isKadomatsu(K[i],K[j],K[k])){
      if(game(((1<<n)-1)^(1<<i)^(1<<j)^(1<<k))==0){
        cout << i << " " << j << " " << k << endl;
        return;
      }
    }
  }
  P(-1);
}

int main() {
    solve();
    return 0;
}