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

datax = [d[0] for d in data]
datay = [d[1] for d in data]

def distance(d, x, y):
    ans = 0
    for i in range(n):
        ans += abs(d[i][0] - x) + abs(d[i][1] - y)
    return ans

count = []

for i in range(min(datax), max(datax)+1):
    for j in range(min(datay), max(datay)+1):
        count.append(distance(data, i, j))

print(min(count))