#include <bits/stdc++.h>
using namespace std;
const int N = 1e2 + 5;
int kiemTraThuTu(const int a[], int i, int j, int z) {
  if (a[i] + a[j] == a[z]) {
    return 1;
  } else if (a[i] + a[z] == a[j]) {
    return 2;
  } else if (a[j] + a[z] == a[i]) {
    return 3;
  } else
    return 0;
}
int main() {
  int n;
  cin >> n;
  int a[N];
  for (int i = 1; i <= n; ++i) cin >> a[i];
  for (int i = 1; i <= n; ++i)
    for (int j = i + 1; j <= n; ++j)
      for (int z = j + 1; z <= n; ++z) {
        int tmp = kiemTraThuTu(a, i, j, z);
        if (tmp != 0) {
          if (tmp == 1) {
            cout << z << ' ' << i << ' ' << j;
            return 0;
          } else if (tmp == 2) {
            cout << j << ' ' << i << ' ' << z;
            return 0;
          } else {
            cout << i << ' ' << j << ' ' << z;
            return 0;
          }
        }
      }
  cout << -1;
  return 0;
}
