object Main {
  def main(args: Array[String]): Unit = {
    solve
  }

  // 処理の方法はわかるけれど、全然整理できたコードにならない。。
  def solve(): Unit = {
    val sc = new java.util.Scanner(System.in)
    val n = sc.nextInt
    val v = new Array[Int](n)
    for (i <- 0 until n) {
      v(i) = sc.nextInt
    }

    val mp = scala.collection.mutable.Map[Int, Int]()
    for (i <- 0 until n by 2) {
      val num = v(i)
      if (mp.contains(num)) mp(num) += 1
      else mp(num) = 1
    }
    val l1 = mp.toList.sortBy(_._2).reverse

    val mp2 = scala.collection.mutable.Map[Int, Int]()
    for (i <- 1 until n by 2) {
      val num = v(i)
      if (mp2.contains(num)) mp2(num) += 1
      else mp2(num) = 1
    }
    val l2 = mp2.toList.sortBy(_._2).reverse

    if (l1(0)._1 != l2(0)._1) {
      println(n - (l1(0)._2 + l2(0)._2))
    } else if (l1.size == 1) {
      println(n - l2(0)._2)
    } else if (l2.size == 1) {
      println(n - l1(0)._2)
    } else {
      if ((l1(0)._2 - l1(1)._2) >= (l2(0)._2 - l2(0)._2)) {
        println(n - (l2(0)._2 + l1(1)._2) + l1(0)._2)
      } else {
        println(n - (l1(0)._2 + l2(1)._2) + l2(0)._2)
      }

    }
  }

}
