#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;

#define EACH(i,a) for (auto& i : a)
#define FOR(i,a,b) for (ll i=(a);i<(b);i++)
#define RFOR(i,a,b) for (ll i=(b)-1;i>=(a);i--)
#define REP(i,n) for (ll i=0;i<(n);i++)
#define RREP(i,n) for (ll i=(n)-1;i>=0;i--)
#define debug(x) cout<<#x<<": "<<x<<endl
#define pb push_back
#define ALL(a) (a).begin(),(a).end()

const ll linf = 1e18;
const int inf = 1e9;
const double eps = 1e-12;
const double pi = acos(-1);

template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
	EACH(x,vec) is >> x;
	return is;
}
/*
template<class... T>
ostream& operator<<(ostream& os, tuple<T...>& t) {
	for (size_t i = 0; i < tuple_size< tuple<T...> >::value; ++i) {
		if (i) os << " ";
		os << get<0>(t);
	}
	return os;
}
*/
template<typename T>
ostream& operator<<(ostream& os, vector<T>& vec) {
	REP(i,vec.size()) {
		if (i) os << " ";
		os << vec[i];
	}
	return os;
}
template<typename T>
ostream& operator<<(ostream& os, vector< vector<T> >& vec) {
	REP(i,vec.size()) {
		if (i) os << endl;
		os << vec[i];
	}
	return os;
}

int N;
int K[30];
bool m1[1 << 12] = {0};
int m2[1 << 12];
int isWin(int rest) {
	if (m1[rest]) return m2[rest];
	int res = 0;
	for (int f = rest; f > 0; f = (f-1)&rest) {
		if ( __builtin_popcount(f) != 3 ) continue;
		vector<int> v;
		REP(i, N) {
			if (f & (1 << (N-i-1))) v.pb(K[i]);
		}
		set<int> s;
		REP(i, 3) {
			s.insert(v[i]);
		}
		if ( s.size() != 3 ) continue;
		assert( v.size() == 3 );
		int m = v[0]+v[1]+v[2] - *min_element( ALL(v) ) - *max_element( ALL(v) );
		if (v[0] != m && v[2] != m) continue;
		if ( isWin(rest^f) == 0 ) {
			res = max(res, f);
		}
	}
	return m1[rest] = true, m2[rest] = res;
}
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
	cin >> N;
	REP(i, N) cin >> K[i];
	if ( isWin((1 << N)-1) ) {
		int w = isWin((1 << N)-1);
		vector<int> ans;
		REP(i, N) {
			if (w & (1 << (N-i-1))) {
				ans.pb(i);
			}
		}
		assert( ans.size() == 3 );
		REP(i, 3) {
			if (i) cout << " ";
			cout << ans[i];
		}
		cout << endl;
	}
	else {
		cout << -1 << endl;
	}
}