from collections import *
from itertools import *
from functools import *
from heapq import *
import sys,math
input = sys.stdin.readline

N = int(input())
XY = [tuple(map(int,input().split())) for _ in range(N)]

ans = -1

def S(X,Y,Z):
    
    dx1,dy1 = Y[0]-X[0],Y[1]-X[1]
    dx2,dy2 = Z[0]-X[0],Z[1]-X[1]
    
    return dx1*dy2-dx2*dy1


def line(X,Y):
    x1,y1 = X
    x2,y2 = Y
    a = y2-y1
    b = x1-x2
    c = x2*y1 - x1*y2
    g = math.gcd(a,b)
    g = math.gcd(g,c)
    a //= g
    b //= g
    c //= g
    if a<0:
        a *= -1
        b *= -1
        c *= -1
    return (a,b,c)

for i in range(N-1):
    XI = XY[i]
    for j in range(i+1,N):
        XJ = XY[j]
        
        a,b,c = line(XI,XJ)
        Z = []
        for k in range(N):
            if k==i:
                continue
            if j==i:
                continue
            Xk = XY[k]
            Z.append((a*Xk[0]+b*Xk[1]+c,Xk))
        Z.sort()
        _,XS = Z[0]
        _,XT = Z[-1]
        tmp = S(XI,XJ,XS)-S(XI,XJ,XT)
        ans = max(ans,tmp)
print(ans)