n = gets.to_i
k_list = gets.split.map(&:to_i)

def kadomatsu?(a, b, c)
  if (a <= b and b <= c) or (c <= b and b <= a)
    return false
  else
    return true
  end
end

k_set_list = [];
0.upto(n-3) do |i|
  (i+1).upto(n-2) do |j|
    (j+1).upto(n-1) do |k|
      if kadomatsu?(k_list[i], k_list[j], k_list[k])
        k_set_list << [i, j, k]
      end
    end
  end
end

def dfs(depth, used, k_set_list)
  if depth == 0
    k_set_list.each_with_index do |k_set, i|
      if dfs(depth + 1, [i], k_set_list)
        return k_set.join(' ')
      end
    end
    return '-1'
  else
    return k_set_list.each_with_index.send("#{depth % 2 == 1 ? 'all' : 'any'}?") do |k_set, i|
      flag = used.all? do |j|
        next false if j == i
        k_set_list[j].all? {|k| not k_set.include?(k) }
      end
      if flag
        dfs(depth + 1, used + [i], k_set_list)
      else
        depth % 2 == 1 ? true : false
      end
    end
  end
end

puts dfs(0, [], k_set_list)