"""


2012:

一番素直そうな問題？
偏角ソート
Aを決め打った時、OAから最も遠い点をすぐに求めればよい



"""

import sys
from sys import stdin

def Monotone_Chain(vlis):

    def upstate(a,b,c):
        B = (b[0]-a[0],b[1]-a[1])
        C = (c[0]-a[0],c[1]-a[1])
        return B[1] * C[0] < C[1] * B[0]

    def downstate(a,b,c):
        B = (b[0]-a[0],b[1]-a[1])
        C = (c[0]-a[0],c[1]-a[1])
        return B[1] * C[0] > C[1] * B[0]

    N = len(vlis)
    vc = [vlis[i] for i in range(N)]

    if N >= 3:
        
        vc.sort()

        uv = []

        for v in vc:
            uv.append(v)
            while len(uv) >= 3 and upstate(uv[-3],uv[-2],uv[-1]):
                del uv[-2]

        dv = []
        for v in vc:
            dv.append(v)
            while len(dv) >= 3 and downstate(dv[-3],dv[-2],dv[-1]):
                del dv[-2]


        #print (uv,dv)
        tmp = dv[1:-1]
        tmp.reverse()
        uv += tmp

        return uv

    else:
        return vc

ans = 0
def calc(p1,p2):
    global ans

    ret = abs(p1[0]*p2[1] - p1[1]*p2[0])

    ans = max(ans,ret)

    return ret

N = int(stdin.readline())

vlis = []
vlis.append( (0,0) )

for i in range(N):

    x,y = map(int,stdin.readline().split())
    vlis.append( (x,y) )

vlis = Monotone_Chain(vlis)

last = 0

m = len(vlis)
for i in range(3*m):

    while last <= i and calc(vlis[(last+1)%m],vlis[i%m]) >= calc(vlis[last%m],vlis[i%m]):
        last += 1

vlis.reverse()
last = 0

m = len(vlis)
for i in range(3*m):

    while last <= i and calc(vlis[(last+1)%m],vlis[i%m]) >= calc(vlis[last%m],vlis[i%m]):
        last += 1

print (ans)