import scala.collection.SortedMap
import scala.io.StdIn

object Main extends App {

  val n = StdIn.readLine().toInt
  val a = StdIn.readLine().split(" ")
  val r = a.foldLeft(SortedMap.empty[Int, Int]) { (acc, s) =>
    val key = s.toInt
    if (acc.contains(key)) acc.updated(key, acc(key) + 1)
    else acc + (key -> 1)
  }.filter(p => 2 <= p._2)

  val rev = r.keys.foldLeft(List.empty[(Int, Int)]) { (acc, i) =>
    (i, r.getOrElse(i, 0)) :: acc
  }
  val ans = if (rev.isEmpty) {
    0
  } else {
    //println(rev)

    def loop(h: Int, w: Int, sticks: List[(Int, Int)]): Int = {
      if (sticks.isEmpty) {
        h * w
      } else if (h < 0 || w < 0) {
        if (sticks.head._2 >= 4 && h < 0) {
          loop(sticks.head._1, sticks.head._1, sticks.tail)
        } else if (sticks.head._2 >= 4 && h > 0) {
          loop(h, sticks.head._1, sticks.tail)
        } else if (sticks.head._2 >= 2 && h < 0) {
          loop(sticks.head._1, -1, sticks.tail)
        } else if (sticks.head._2 >= 2 && h > 0) {
          loop(h, sticks.head._1, sticks.tail)
        } else {
          loop(h, w, sticks.tail)
        }
      } else {
        h * w
      }
    }

    loop(-1, -1, rev)
  }

  println(ans)
}
