# maximum-quadrilateral

def solve(n, points):
  ans = 0
  for i in range(n):
    for j in range(i+1, n):
      x1, y1 = points[i]
      x2, y2 = points[j]
      di = (x2 - x1) ** 2 + (y2 - y1) ** 2
      a = y1 - y2
      b = x2 - x1
      c = x1 * y2 - x2 * y1
      max_u = 0
      max_d = 0
      for k in range(n):
        x, y = points[k]
        max_u = max(max_u, a*x+b*y+c)
        max_d = min(max_d, a*x+b*y+c)
      if max_u == 0 or max_d == 0:
        continue
      s_u = (max_u ** 2) * di // (a ** 2 + b ** 2)
      s_u = round(s_u ** 0.5)
      s_d = (max_d ** 2) * di // (a ** 2 + b ** 2)
      s_d = round(s_d ** 0.5)
      ans = max(ans, s_u+s_d)
  return ans


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