There are N bags, each containing two white balls. The i-th box contains two balls with integers x_i and y_i written on them, respectively.
For each of these bags, you will paint one of the balls red, and paint the other blue.
Afterwards, the 2N balls will be classified according to color.
Then, we will define the following:
 - R_{max}: the maximum integer written on a ball painted in red
 - R_{min}: the minimum integer written on a ball painted in red
 - B_{max}: the maximum integer written on a ball painted in blue
 - B_{min}: the minimum integer written on a ball painted in blue
Find the minimum possible value of (R_{max} - R_{min}) \times (B_{max} - B_{min}).

-----Constraints-----
 - 1 ≤ N ≤ 200,000
 - 1 ≤ x_i, y_i ≤ 10^9

-----Input-----
Input is given from Standard Input in the following format:
N
x_1 y_1
x_2 y_2
:
x_N y_N

-----Output-----
Print the minimum possible value.

-----Sample Input-----
3
1 2
3 4
5 6

-----Sample Output-----
15

The optimal solution is to paint the balls with x_1, x_2, y_3 red, and paint the balls with y_1, y_2, x_3 blue.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'N = int(input())\nBall = []\nfor i in range(N):\n    x, y = list(map(int, input().split()))\n    x, y = min(x, y), max(x, y)\n    Ball.append((x, y))\n\nBall.sort()  # ソートしておく\nX = [x for x, y in Ball]\nY = [y for x, y in Ball]\n\n# 全体のMIN, MAX\nMIN = X[0]\nMAX = max(Y)\n\n# 確定2玉を別グループに\nans = (max(X) - MIN) * (MAX - min(Y))\n\n# 確定2玉を同じグループに\n\n# 全体のMAX・MINが確定している場所は、もう片方を使うしかない\nMIN_index, MAX_index = X.index(MIN), Y.index(MAX)\n\n# 選ばざるを得ないやつ\nMIN_O = X[MAX_index]\nMAX_O = Y[MIN_index]\nMIN_O, MAX_O = min(MIN_O, MAX_O), max(MIN_O, MAX_O)\n\n# 選択肢がないやつを削除\nBall = [Ball[i] for i in range(N) if i not in (MIN_index, MAX_index)]\n\n# つくりおし\nX = [x for x, y in Ball]\nY = [y for x, y in Ball]\n\n# とりあえず小さいほうを集めたことにしておく\nB = [x for x in X] + [MAX_O, MIN_O]\nB_max = max(B)\n\nfor i in range(len(Ball)):\n    x, y = X[i], Y[i]\n    if B_max - x > B_max - y >= 0:\n        B[i] = y\n    else:\n        break\n\nans = min(ans, (MAX - MIN) * (max(B) - min(B)))\nprint(ans)\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 13739