package main
import (
  "bufio"
  "os"
  "strconv"
  "strings"
  "fmt"
)

type Evaluator func(a, b interface{}) interface{}
func Max(a, b interface{}) interface{} {
  if a.([]int)[0] < b.([]int)[0] { return b }
  return a
}
func Min(a, b interface{}) interface{} {
  if a.([]int)[0] < b.([]int)[0] { return a }
  return b
}
type SegmentTree struct {
  size  int
  data  []interface{}
  inf   interface{}
  eval  Evaluator
}
func InitSegmentTree(N int, inf interface{}, eval Evaluator) *SegmentTree {
  size := 1
  for size < N {
    size *= 2
  }
  S := make([]interface{}, size * 2)
  for i := range S {
    S[i] = inf
  }
  return &SegmentTree{
    size: size,
    data: S,
    inf:  inf,
    eval: eval,
  }
}
func (ST *SegmentTree) Update(index int, value interface{}) {
  idx := ST.size + index
  ST.data[idx] = value
  for idx > 1 {
    parent := idx / 2
    ST.data[parent] = ST.eval(ST.data[2 * parent], ST.data[2 * parent + 1])
    idx = parent
  }
}
func (ST *SegmentTree) Get(from, to, index, left, right int) interface{} {
  // get [from, to)
  if to <= left || right <= from { return ST.inf }
  if from <= left && right <= to { return ST.data[index] }
  m := (left + right) / 2
  lval := ST.Get(from, to, 2 * index, left, m)
  rval := ST.Get(from, to, 2 * index + 1, m, right)
  return ST.eval(lval, rval)
}
func (ST *SegmentTree) Query(from, to int) interface{} {
  return ST.Get(from, to, 1, 0, ST.size)
}

func Solve() {
  var N, x, y int
  NextInt(&N)
  Rmax := InitSegmentTree(N, []int{0, 0}, Max)
  Rmin := InitSegmentTree(N, []int{1000000007, 0}, Min)
  Bmax := InitSegmentTree(N, []int{0, 0}, Max)
  Bmin := InitSegmentTree(N, []int{1000000007, 0}, Min)
  R := make([]int, N)
  B := make([]int, N)
  for i := 0; i < N; i++ {
    NextInt(&x, &y)
    if x < y { x, y = y, x }
    Rmax.Update(i, []int{x, i})
    Rmin.Update(i, []int{x, i})
    Bmax.Update(i, []int{y, i})
    Bmin.Update(i, []int{y, i})
    R[i], B[i] = x, y
  }
  A := func() int { return (Rmax.Query(0, N).([]int)[0] - Rmin.Query(0, N).([]int)[0]) * (Bmax.Query(0, N).([]int)[0] - Bmin.Query(0, N).([]int)[0]) }
  ans := A()
  for i := 0; i < N; i++ {
    j := Bmin.Query(0, N).([]int)[1]
    if R[j] <= B[j] { break }
    R[j], B[j] = B[j], R[j]
    Rmax.Update(j, []int{R[j], j})
    Rmin.Update(j, []int{R[j], i})
    Bmax.Update(j, []int{B[j], j})
    Bmin.Update(j, []int{B[j], j})
    ans = MinInt(A(), ans)
  }
  Write(ans)
}

func main() {
  Solve()
  Output()
}

var reader = bufio.NewReaderSize(os.Stdin, 1000000)
var writer = bufio.NewWriter(os.Stdout)
func NextLine() string {
  buffer := make([]byte, 0)
  for true {
    line, isPrefix, err := reader.ReadLine()
    if err != nil { panic(err) }
    buffer = append(buffer, line...)
    if !isPrefix { break }
  }
  return string(buffer)
}
func NextInt(A ...*int) {
  L := strings.Split(NextLine(), " ")
  for i, a := range A {
    *a, _ = strconv.Atoi(L[i])
  }
}
func NextIntVec(A *[]int) {
  L := strings.Split(NextLine(), " ")
  (*A) = make([]int, len(L))
  for i, l := range L {
    (*A)[i], _ = strconv.Atoi(l)
  }
}
func NextFloat(A ...*float64) {
  L := strings.Split(NextLine(), " ")
  for i, a := range A {
    *a, _ = strconv.ParseFloat(L[i], 64)
  }
}
func NextFloatVec(A *[]float64) {
  L := strings.Split(NextLine(), " ")
  (*A) = make([]float64, len(L))
  for i, l := range L {
    (*A)[i], _ = strconv.ParseFloat(l, 64)
  }
}
func Write(s interface{}) {
  fmt.Fprintln(writer, s)
}
func WriteIntVec(A []int) {
  S := make([]string, len(A))
  for i, a := range A {
    S[i] = strconv.Itoa(a)
  }
  Write(strings.Join(S, " "))
}
func Output() {
  _ = writer.Flush()
}
func MaxInt(A ...int) int {
  max := A[0]
  for _, a := range A {
    if max < a { max = a }
  }
  return max
}
func MinInt(A ...int) int {
  min := A[0]
  for _, a := range A {
    if a < min { min = a }
  }
  return min
}
func SumInt(A ...int) int {
  sum := 0
  for _, a := range A {
    sum += a
  }
  return sum
}
func AbsInt(x int) int {
  if x < 0 { x = -x }
  return x
}

Measured memory_bytes: 94976