#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll search(ll a, ll b, vector<ll> v) {
  ll sum = a + b;
  for (ll i = 0; i < v.size(); i++) {
    if (v[i] == sum) return i;
  }
  return -1;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  ll n;
  cin >> n;
  vector<ll> v;
  for (ll i = 0; i < n; i++) {
    ll k;
    cin >> k;
    v.push_back(k);
  }
  ll t, p, q, r;
  for (ll i = 0; i < n - 1; i++) {
    for (ll j = i + 1; j < n; j++) {
      t = search(v[i], v[j], v);
      if (t != -1) {
        p = j + 1;
        q = i + 1;
        r = t + 1;
        break;
      }
    }
    if (t != -1) break;
  }
  if (t == -1) {
    cout << -1 << '\n';
  } else {
    cout << r << " " << p << " " << q << '\n';
  }
  return 0;
}
