def cross3(a, b, c):
    return (b[0] - a[0]) * (c[1] - a[1]) - (b[1] - a[1]) * (c[0] - a[0])

# ps = [(x, y), ...]: ソートされた座標list
def convex_hull(ps):
    qs = []
    n = len(ps)
    for p in ps:
        # 一直線上で高々2点にする場合は ">=" にする
        while len(qs) > 1 and cross3(qs[-1], qs[-2], p) >= 0:
            qs.pop()
        qs.append(p)
    t = len(qs)
    for i in range(n - 2, -1, -1):
        p = ps[i]
        while len(qs) > t and cross3(qs[-1], qs[-2], p) >= 0:
            qs.pop()
        qs.append(p)
    qs.pop()
    return qs

n = int(input())
xy = [list(map(int, input().split())) for _ in range(n)]
xy.sort()
xy = convex_hull(xy)
n = len(xy)
xy += xy

def S(i, j):
    return abs(xy[i][0] * xy[j][1] - xy[i][1] * xy[j][0])

ans = 0
r = 1
for l in range(n):
    bef = S(l, r)
    while S(l, r + 1) >= bef:
        bef = S(l, r + 1)
        r += 1
    ans = max(ans, bef)
print(ans)