#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <set>
#include <map>
#include <queue>
#include <tuple>
#include <unordered_set>
#include <unordered_map>
#include <functional>
#include <cstdio>
#include <cassert>
#define repeat(i,n) for (int i = 0; (i) < (n); ++(i))
#define repeat_from(i,m,n) for (int i = (m); (i) < (n); ++(i))
typedef long long ll;
using namespace std;
bool is_kadomatsu(int a, int b, int c) {
    if (a == b or b == c or c == a) return false;
    if (a < b and b < c) return false;
    if (a > b and b > c) return false;
    return true;
}
int main() {
    int n; cin >> n;
    vector<int> k(n); repeat (i,n) cin >> k[i];
    vector<bool> dp(1<<n); // grundy number
    repeat (s, 1<<n) {
        set<int> gs;
        repeat (a,n) if (s & (1<<a)) {
            repeat_from (b,a+1,n) if (s & (1<<b)) {
                repeat_from (c,b+1,n) if (s & (1<<c)) {
                    if (not is_kadomatsu(k[a], k[b], k[c])) continue;
                    if (not dp[s & ~ ((1<<a) | (1<<b) | (1<<c))]) {
                        dp[s] = true;
                        goto done;
                    }
                }
            }
        }
done:;
    }
    repeat (a,n) {
        repeat_from (b,a+1,n) {
            repeat_from (c,b+1,n) {
                if (not is_kadomatsu(k[a], k[b], k[c])) continue;
                if (not dp[((1<<n)-1) & ~ ((1<<a) | (1<<b) | (1<<c))]) {
                    cout << a << ' ' << b << ' ' << c << endl;
                    return 0;
                }
            }
        }
    }
    cout << -1 << endl;
    return 0;
}