#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;

int N;
int Dwin[1<<12];
int nums[12];
int ans[3];
inline bool OK(int x, int y, int z) {
  if (nums[x] != nums[y] && nums[y] != nums[z] && nums[x] != nums[z]) {
    int cur[3] = {nums[x],nums[y],nums[z]};
    sort(cur, cur + 3);
    return (cur[1] == nums[x] || cur[1] == nums[z]);
  }
  return false;
}
bool dp_go(int bit, bool D){
  if (__builtin_popcount(bit) < 3) {
    return !D;
  }
  if (Dwin[bit] != 0) {
    return Dwin[bit] > 0;
  }

  vector <int> ones;
  rep(i,N){
    if (bit & (1 << i)) {
      ones.pb(i);
    }
  }
  if (D) {
    rep(i,sz(ones)) {
      rep2(j,i+1,sz(ones)) {
        rep2(k,j+1,sz(ones)) {
          if (!OK(ones[i],ones[j],ones[k])) {
            continue;
          }
          int nbit = (((bit ^ (1<<ones[i])) ^(1<<ones[j])) ^(1<<ones[k]));
          if (dp_go(nbit,!D)) {
            ans[0] = ones[i];ans[1] = ones[j];ans[2] = ones[k];
            Dwin[bit] = 1;
            return true;
          }
        }
      }
    }
    Dwin[bit] = -1;
    return false;
  }else{
    rep(i,sz(ones)) {
      rep2(j,i+1,sz(ones)) {
        rep2(k,j+1,sz(ones)) {
          if (!OK(ones[i],ones[j],ones[k])) {
            continue;
          }
          int nbit = (((bit ^ (1<<ones[i])) ^(1<<ones[j])) ^(1<<ones[k]));
          if (!dp_go(nbit,!D)) {
            Dwin[bit] = -1;
            return false;
          }
        }
      }
    }
    Dwin[bit] = 1;
    return true;
  }
}
int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cin >> N;
  rep(i,N){
    cin >> nums[i];
  }
  if (dp_go((1<<N)-1,true)) {
    cout << ans[0] << ' ' << ans[1] << ' ' << ans[2] << endl;
  }else{
    cout << -1 << endl;
  }
  return 0;
}