package main
import (
  "bufio"
  "os"
  "strconv"
  "strings"
  "fmt"
  "sort"
  "container/heap"
)

type Balls [][]int
func (B Balls) Len() int { return len(B) }
func (B Balls) Less(i, j int) bool {
  if B[i][0] == B[j][0] { return B[i][1] > B[j][1] }
  return B[i][0] < B[j][0]
}
func (B Balls) Swap(i, j int) { B[i], B[j] = B[j], B[i] }

type Item struct {
  Priority int
  Entry interface{}
}
type Heap []*Item
func (H Heap) Len() int { return len(H) }
func (H Heap) Less(i, j int) bool { return H[i].Priority < H[j].Priority }
func (H Heap) Swap(i, j int) { H[i], H[j] = H[j], H[i] }
func (H *Heap) Pop() interface{} {
  Old := *H
  n := len(Old)
  item := Old[n - 1]
  *H = Old[0:n - 1]
  return item
}
func (H *Heap) Push(x interface{}) {
  item := x.(*Item)
  *H = append(*H, item)
}
type PriorityQueue struct {
  Comparator func(e interface{}) int
  Items Heap
}
func (PQ *PriorityQueue) Push(e interface{}) {
  item := Item{PQ.Comparator(e), e}
  heap.Push(&PQ.Items, &item)
}
func (PQ *PriorityQueue) Pop() interface{} {
  return heap.Pop(&PQ.Items).(*Item).Entry
}
func InitPQ(F func(interface{}) int) PriorityQueue {
  var H Heap
  return PriorityQueue{F, H}
}

func Solve() {
  var N, x, y int
  NextInt(&N)
  XY := make([][]int, N)
  for i := 0; i < N; i++ {
    NextInt(&x, &y)
    if x > y { x, y = y, x }
    XY[i] = []int{x, y}
  }
  sort.Sort(Balls(XY))
  R := make([]int, N)
  B := make([]int, N)
  for i, xy := range XY { R[i], B[i] = xy[0], xy[1] }
  ans := (MaxInt(R...) - MinInt(R...)) * (MaxInt(B...) - MinInt(B...))
  max := 0
  for i, b := range B {
    if B[max] < b { max = i }
  }
  if max != 0 {
    if max != 1 {
      R[max], R[1] = R[1], R[max]
      B[max], B[1] = B[1], B[max]
    }
    R[1], B[1] = B[1], R[1]
    r := R[1] - R[0]
    min := MinInt(B...)
    F := func(e interface{}) int { return -e.([]int)[0] }
    Q := InitPQ(F)
    for i, b := range B { Q.Push([]int{b, i}) }
    for i := 0; i < N; i++ {
      q := Q.Pop().([]int)
      j := q[1]
      ans = MinInt(r * (q[0] - min), ans)
      if R[j] >= B[j] { break }
      min = MinInt(R[j], min)
      Q.Push([]int{R[j], j})
    }
  }
  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: 41984