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

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

for k in range(n):
	count = []
	for i in range(300):
		for j in range(300):
			count.append(
				distance(data, i, j))

print(min(count))