using System; using System.Collections; using System.Collections.Generic; using System.Linq; using System.IO; class Meguru { public Meguru() { } public static int Main() { new Meguru().calc(); return 0; } Scanner cin; void calc() { cin = new Scanner(); int N = cin.nextInt(); int[] K = new int[N]; for (int i = 0; i < N; i++) { K[i] = cin.nextInt(); } bool[] dp = new bool[1 << N]; for (int t = 0; t < (1 << N); t++) { for (int i = 0; i < N && !dp[t]; i++) { if ((t >> i) % 2 == 0) continue; for (int j = i + 1; j < N && !dp[t]; j++) { if ((t >> j) % 2 == 0) continue; if (K[j] == K[i]) continue; for (int k = j + 1; k < N && !dp[t]; k++) { if ((t >> k) % 2 == 0) continue; if (K[k] == K[i]) continue; if (K[k] == K[j]) continue; if (K[j] <= K[k] && K[j] >= K[i]) continue; if (K[j] >= K[k] && K[j] <= K[i]) continue; if (!dp[t - (1 << i) - (1 << j) - (1 << k)]) { dp[t] = true; if (t == (1 << N) - 1) { Console.WriteLine(i + " " + j + " " + k); return; } break; } } } } } Console.WriteLine(-1); } } class Scanner { string[] s; int i; char[] cs = new char[] { ' ' }; public Scanner() { s = new string[0]; i = 0; } public string next() { if (i < s.Length) return s[i++]; string st = Console.ReadLine(); while (st == "") st = Console.ReadLine(); s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries); i = 0; return next(); } public int nextInt() { return int.Parse(next()); } public long nextLong() { return long.Parse(next()); } public double nextDouble() { return double.Parse(next()); } }