import math

def toInt(x):
    return int(x)

def findByX(a):
    return a[0]

def findByY(a):
    return a[1]

n = int(input())
zoz = []

for i in range(n):
    zoz.append(list(map(toInt, input().split())))

m = n / 4

for i in range(int(m-1)):
    helper = set()
    idx = zoz.index(min(zoz, key=findByX))
    idx2 = zoz.index(min(zoz[:idx] + zoz[idx+1:], key=findByX))
    if zoz[idx][0] == zoz[idx2][0]:
        helper.add(idx)
        helper.add(idx2)
    else:
        helper.add(idx)
    idx = zoz.index(min(zoz, key=findByY))
    idx2 = zoz.index(min(zoz[:idx] + zoz[idx+1:], key=findByY))
    if zoz[idx][1] == zoz[idx2][1]:
        helper.add(idx)
        helper.add(idx2)
    else:
        helper.add(idx)
    idx = zoz.index(max(zoz, key=findByX))
    idx2 = zoz.index(max(zoz[:idx] + zoz[idx+1:], key=findByX))
    if zoz[idx][0] == zoz[idx2][0]:
        helper.add(idx)
        helper.add(idx2)
    else:
        helper.add(idx)
    idx = zoz.index(max(zoz, key=findByY))
    idx2 = zoz.index(max(zoz[:idx] + zoz[idx+1:], key=findByY))
    if zoz[idx][1] == zoz[idx2][1]:
        helper.add(idx)
        helper.add(idx2)
    else:
        helper.add(idx)
    helper = list(helper)
    helper.sort()
    for j in range(4):
        zoz.pop(helper[j]-j)

ds = []
for i in range(3):
    ds.append( math.sqrt((zoz[-1][0] - zoz[i][0])**2+(zoz[-1][1]- zoz[i][1])**2))

ds.pop(ds.index(max(ds)))
print(ds[0] * ds[1])