#include <bits/stdc++.h>
using namespace std;
void solve(int nForm, int form[], int& iAns, int& jAns, int& kAns) {
  for (int i = 0; i < nForm; i++)
    for (int j = 0; j < nForm; j++)
      for (int k = j; k < nForm; k++) {
        if (i == j || i == k || j == k) continue;
        if (form[i] == form[j] + form[k]) {
          iAns = i + 1;
          jAns = j + 1;
          kAns = k + 1;
          return;
        }
      }
  return;
}
int main() {
  int nForm, form[105];
  cin >> nForm;
  for (int i = 0; i < nForm; i++) cin >> form[i];
  int iAns = -1, jAns = -1, kAns = -1;
  solve(nForm, form, iAns, jAns, kAns);
  if (iAns == -1)
    cout << "-1";
  else
    cout << iAns << " " << jAns << " " << kAns;
  return 0;
}
