import math
n = int(input())
arr = []
m_size = 999999999999999999999999999999999999999999
for i in range(n):
    arr.append(list(map(int,input().split(" "))))
    if i < 3:
        continue;
    for j in range(i):
        vec_to = [arr[j][0] - arr[i][0], arr[j][1] - arr[i][1]]
        for k in range(j+1, i, 1):
            vec_to2 = [arr[k][0] - arr[i][0], arr[k][1] - arr[i][1]]
            if vec_to[0] * vec_to2[0] + vec_to[1] * vec_to2[1] == 0:
                for m in range(i):
                    vec_to3 = [arr[m][0] - arr[k][0], arr[m][1] - arr[k][1]]
                    if vec_to3[0] == vec_to[0] and vec_to3[1] == vec_to[1]:
                        l2 = math.sqrt((vec_to2[0] **2 + vec_to2[1] **2))
                        l1 = math.sqrt((vec_to[0] **2 + vec_to[1] **2))
                        m_size = min(m_size, l1 * l2)
print(int(m_size))