#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;

int n, kd[12], dp[1<<12];
bool kdmt(int i, int j, int k){
  return (j > i && j > k || j < i && j < k) && j != k;
}
int check(int a){
  if(pcnt(a) < 3) return -1;
  vi v;
  FOR(i, 0, n)if(a>>i & 1)v.pb(i);
  int l = sz(v);
  FOR(i, 0, l-2)FOR(j, i+1, l-1)FOR(k, j+1, l){
    if(kdmt(kd[v[i]], kd[v[j]], kd[v[k]]) && dp[a - (1<<v[i]) - (1<<v[j]) - (1<<v[k])] < 0) return v[i] * 169 + v[j] * 13 + v[k];
  }
  return -1;
}
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n;
  FOR(i, 0, n)cin >> kd[i];
  FOR(i, 0, 1<<n)dp[i] = check(i);
  int ans = dp[(1<<n) - 1];
  if(ans > 0){
    cout << ans / 169 << " " << ans % 169 / 13 << " " << ans % 13 << endl;
  }else{
    cout << -1 << endl;
  }
  return 0;
}