# import pypyjit;pypyjit.set_param("max_unroll_recursion=-1")
# from bisect import *
# from collections import *
# from heapq import *
# from itertools import *
# from math import *
# from datetime import *
# from decimal import*
# from string import ascii_lowercase,ascii_uppercase
# import numpy as np
import sys
import os

# sys.setrecursionlimit(10**6)
INF = 10**18
MOD = 998244353
# MOD = 10**9 + 7
File = open("input.txt", "r") if os.path.exists("input.txt") else sys.stdin


def input():
    return File.readline()[:-1]


# ///////////////////////////////////////////////////////////////////////////


N = int(input())
wani = [list(map(int, input().split())) for _ in range(N)]
ans = INF
for i in range(301):
    for j in range(301):
        total = 0
        for k in range(N):
            dist = abs(wani[k][0] - i) + abs(wani[k][1] - j)
            total += dist
        if total < ans:
            ans = total
print(ans)