import scala.collection.mutable

object Main extends App {
  implicit val ordering: Ordering[(Int, Vector[Int])] = Ordering.by(- _._1)
  val heap = mutable.PriorityQueue.empty[(Int, Vector[Int])]

  def isSorted(s: Seq[Int]): Boolean =
    (0 until s.length-1).dropWhile(i => s(i) < s(i+1)).isEmpty

  def solution(a: Vector[Int]): Int = {

    def loop(): Int = {
      val (cost, seq) = heap.dequeue()
      if(isSorted(seq)) cost
      else {
        for{
          i <- seq.indices
          j <- i+1 until seq.length
          si = seq(i)
          sj = seq(j)
        } heap.enqueue((cost + si + sj, seq.updated(i, sj).updated(j, si)))
        loop()
      }
    }

    loop()
  }

  val _ = io.StdIn.readInt()
  val init: Vector[Int] = io.StdIn.readLine().split(" ").map(_.toInt).toVector
  heap.enqueue((0, init))
  println(solution(init))
}