import scala.collection.mutable

object ALDS1_6_D 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(i: Int): Int = {
      val e@(cost, seq) = heap.dequeue()
      if (isSorted(seq)) cost
      else {
        if (i < seq.length && seq.slice(i, seq.length).min == seq(i)) heap.enqueue(e)
        for (j <- i+1 until seq.length)
          heap.enqueue((cost + seq(i) + seq(j), seq.updated(i,seq(j)).updated(j, seq(i))))
        loop(i+1)
      }
    }
    loop(0)
  }

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