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

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define UB upper_bound
#define LB lower_bound
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

int n, a[12];
bool used[12];

bool is_kado(int x, int y, int z) {
	return ((x < y && y > z) || (x > y && y < z)) && x != z;
}

array<int, 3> solve() {
	incID(i, 0, n) { if(used[i]) { continue; } used[i] = true;
	incID(j, i, n) { if(used[j]) { continue; } used[j] = true;
	incID(k, j, n) { if(used[k]) { continue; } used[k] = true;
		if(is_kado(a[i], a[j], a[k])) {
			auto ret = solve();
			if(ret[0] == -1) {
				used[i] = false;
				used[j] = false;
				used[k] = false;
				return { i, j, k };
			}
		}
	used[k] = false; }
	used[j] = false; }
	used[i] = false; }
	
	return { -1, 0, 0 };
}

int main() {
	cin >> n;
	inc(i, n) { cin >> a[i]; }
	
	auto ret = solve();
	if(ret[0] == -1) { cout << -1 << endl; }
	else {
		inc(i, 3) { cout << (i == 0 ? "" : " ") <<ret[i]; }
		cout << endl;
	}
	
	return 0;
}