#include using namespace std; typedef long long ll; typedef long double ld; typedef vector vi; typedef vector vd; typedef vector vll; typedef vector vs; typedef vector vb; typedef pair pii; struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star; #define all(c) (c).begin(), (c).end() #define rall(c) (c).rbegin(), (c).rend() #define vv(type, c, m, n, i) vector> c(m, vector(n, i)) #define mat(type, c, m, n) vector> c(m, vector(n));for(auto& r:c)for(auto& i:r)cin>>i; #define rep(i,a,n) for(int i=(a), i##_len=(n); ii##_len; --i) #define each(x,y) for(auto &(x):(y)) #define var(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__); template void Scan(T& t) { cin >> t; } templatevoid Scan(First& first, Rest&...rest) { cin >> first; Scan(rest...); } #define vec(type, c, n) vector c(n);for(auto& i:c) cin>>i; #define len(x) ((int)(x).size()) #define mp make_pair #define eb emplace_back #define em emplace #define pb pop_back #define fi first #define se second #define get(a, i) get(a) #define bit_count __builtin_popcount #define mt make_tuple inline string zero(int a,string s,char c='0'){return string(a-len(s),c)+s;} inline string zero(int a,int t,char c='0'){return zero(a, to_string(t), c);} inline string zero(int a,ll t,char c='0'){return zero(a, to_string(t), c);} #define mini min_element #define maxi max_element #define sum accumulate #define chmax(a,b) if(ab)a=b template inline void print(T t){cout << t << '\n';} template inline void print(H h, T... t){cout << h << " ";print(t...);} int n; int k[12]; bool check(int a, int b, int c) { return a != c && ((a < b && b > c) || (a > b && b < c)); } bool f(int cnt, int bit, int user) { if (cnt < 3) { return !user; } rep(i, 0, n - 2) { if (!((1 << i) & bit)) continue; rep(j, i + 1, n - 1) { if (!((1 << j) & bit)) continue; rep(l, j + 1, n) { if (!((1 << l) & bit)) continue; if (check(k[i], k[j], k[l])) { if(f(cnt - 3, bit - (1 << i) - (1 << j) - (1 << l), 1 - user) == user) return user; } } } } return !user; } void solve() { cin >> n; int bit = (1 << n) - 1; rep(i, 0, n) cin >> k[i]; rep(i, 0, n - 2) { rep(j, i + 1, n - 1) { rep(l, j + 1, n) { if (check(k[i], k[j], k[l])) { if(!f(n - 3, bit - (1 << i) - (1 << j) - (1 << l), 1)) { print(i, j, l); return; } } } } } print(-1); } int main() { solve(); return 0; }