# input
import sys
input = sys.stdin.readline
II = lambda : int(input())
MI = lambda : map(int, input().split())
LI = lambda : [int(a) for a in input().split()]
SI = lambda : input().rstrip()
LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)]
LSI = lambda n : [input().rstrip() for _ in range(n)]
MI_1 = lambda : map(lambda x:int(x)-1, input().split())
LI_1 = lambda : [int(a)-1 for a in input().split()]

mod = 998244353
inf = 1001001001001001001
ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97
ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97
yes = lambda : print("Yes")
no = lambda : print("No")
yn = lambda flag : print("Yes" if flag else "No")

prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)
alplow = "abcdefghijklmnopqrstuvwxyz"
alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}
DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]
prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]
sys.set_int_max_str_digits(0)
# sys.setrecursionlimit(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')

from collections import defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
DD = defaultdict
BSL = bisect_left
BSR = bisect_right


n = II()

us = []
vs = []
p = []
for i in range(n):
    x, y = MI()
    u = x - y
    v = x + y
    us.append(u)
    vs.append(v)
    p.append((u, v))

us.sort()
vs.sort()

def solve(x):
    for a in range(us[0], us[-1]):
        for b in range(vs[0], vs[-1]):
            l, r, d, d2 = inf, -inf, inf, -inf
            for u, v in p:
                if a<=u<=a+x and b<=v<=b+x:
                    continue
                # そうでないのは外
                l = min(l, u)
                r = max(r, u)
                d = min(d, v)
                d2 = max(d2, v)
                
            if r - l <= x and d2 - d <= x:
                return True
    
    return False
                
    

ng = 0
ok = max(us[-1] - us[0], vs[-1] - vs[0])
while ok - ng > 1:
    m = ok + ng >> 1
    if solve(m):
        ok = m
    else:
        ng = m
print(ok)