#include <bits/stdc++.h>
using namespace std;
struct info {
  int val;
  int index;
};
info a[100];
bool findNum(int &index1, int &index2, int find) {
  while (index1 < index2) {
    int sum = a[index1].val + a[index2].val;
    if (sum == a[find].val)
      return true;
    else if (sum > a[find].val)
      index2--;
    else
      index1++;
  }
  return false;
}
bool compareFunc(info a, info b) { return a.val < b.val; }
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    int temp;
    cin >> temp;
    info b;
    b.index = (i + 1);
    b.val = temp;
    a[i] = b;
  }
  sort(a, a + n, compareFunc);
  for (int i = 2; i < n; i++) {
    int index1 = 0, index2 = (i - 1);
    if (findNum(index1, index2, i)) {
      cout << a[i].index << " " << a[index2].index << " " << a[index1].index
           << endl;
      return 0;
    }
  }
  cout << "-1" << endl;
  return 0;
}
