fn is_kadomatsu(i: usize, j: usize, k: usize, val: &Vec<usize>) -> bool {
       (val[i] < val[j] && val[k] < val[j])
    || (val[i] > val[j] && val[k] > val[j])
}

fn dfs(n: usize, val: &Vec<usize>, used: &mut Vec<bool>) -> Option<(usize, usize, usize)> {
    for i in 0..n {
        if used[i] { continue; }
        for j in i..n {
            if used[j] { continue; }
            for k in j..n {
                if used[k] { continue; }
                if is_kadomatsu(i, j, k, val) {
                    used[i] = true;
                    used[j] = true;
                    used[k] = true;
                    let result = dfs(n, val, used);
                    used[i] = false;
                    used[j] = false;
                    used[k] = false;
                    if result.is_none() {
                        return Some((i, j, k));
                    }
                }
            }
        }
    }
    None
}

//TODO
fn main() {
    let mut n = String::new();
    std::io::stdin().read_line(&mut n).ok();
    let n: usize = n.trim().parse().unwrap();
    let mut val = String::new();
    std::io::stdin().read_line(&mut val).ok();
    let val: Vec<usize> = val.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();

    let mut used: Vec<bool> = vec![false; n];
    let result = dfs(n, &val, &mut used);
    if result.is_some() {
        println!("{} {} {}", result.unwrap().0, result.unwrap().1, result.unwrap().2);
    } else {
        println!("-1");
    }
}