#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

bool iskdmt(int a,int b,int c) {
    return (a<b&&c<b||b<a&&b<c)&&a!=c;
}

bool dfs(int x, int n, int a[]) {
    for (int i=0;i<n;i++) {
        if (x&1<<i) continue;
        for (int j=i+1;j<n;j++) {
            if (x&1<<j) continue;
            for (int k=j+1;k<n;k++) {
                if (x&1<<k) continue;
                if (!iskdmt(a[i],a[j],a[k])) continue;
                if (!dfs(x|1<<i|1<<j|1<<k,n,a)) return true;
            }
        }
    }
    return false;
}

int main() {
    int n;
    cin>>n;
    int a[n];
    for (int i=0;i<n;i++) cin>>a[i];
    for (int i=0;i<n;i++)
        for (int j=i+1;j<n;j++)
            for (int k=j+1;k<n;k++) {
                if (!iskdmt(a[i],a[j],a[k])) continue;
                if (!dfs(1<<i|1<<j|1<<k,n,a)) {
                    cout<<i<<' '<<j<<' '<<k<<endl;
                    return 0;
                }
            }
    cout<<-1<<endl;
    return 0;
}