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

max_area = 0

for i in range(n):
    ax, ay = points[i]
    for j in range(i + 1, n):
        bx, by = points[j]
        dx = bx - ax
        dy = by - ay
        current_max = -float('inf')
        current_min = float('inf')
        for k in range(n):
            if k == i or k == j:
                continue
            px, py = points[k]
            cross = (px - ax) * dy - (py - ay) * dx
            if cross > current_max:
                current_max = cross
            if cross < current_min:
                current_min = cross
        candidate = current_max - current_min
        if candidate > max_area:
            max_area = candidate

print(max_area)