#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <string>
#include <algorithm>
#include <iomanip>
using namespace std;

int N;
int K[12];

bool kadomatsu(int a, int b, int c) {
	if(a == b || b == c || c == a) return false;
	return b < a && b < c || b > a && b > c;
}

int f(int rem, vector<int>& move) {
	int ret = -1;
	for(int i = 0; i < N; i++) {
		if(rem >> i & 1) continue;
		for(int j = i + 1; j < N; j++) {
			if(rem >> j & 1) continue;
			for(int k = j + 1; k < N; k++) {
				if(rem >> k & 1) continue;
				if(kadomatsu(K[i], K[j], K[k])) {
					vector<int> m(3, 100);
					int res = -f(rem ^ (1 << i) ^ (1 << j) ^ (1 << k), m);
					if(res == 1) {
						vector<int> mm({ i, j, k });
						move = min(move, mm);
						ret = 1;
					}
				}
			}
		}
	}
	return ret;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	cin >> N;
	for(int i = 0; i < N; i++) {
		cin >> K[i];
	}

	vector<int> m(3, 100);
	if(f(0, m) == 1) {
		for(int i = 0; i < 3; i++) {
			cout << m[i] << " ";
		}
		cout << endl;
	}
	else {
		cout << -1 << endl;
	}
}