import sys
from itertools import permutations
from heapq import *

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

class SegmentTree:
    def __init__(self, init_val, segfunc, ide_ele):
        n = len(init_val)
        self.segfunc = segfunc
        self.ide_ele = ide_ele
        self.num = 1 << (n - 1).bit_length()
        self.tree = [ide_ele] * 2 * self.num
        self.size = n
        for i in range(n):
            self.tree[self.num + i] = init_val[i]
        for i in range(self.num - 1, 0, -1):
            self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])

    def update(self, k, x):
        k += self.num
        self.tree[k] = self.segfunc(self.tree[k],x)
        while k > 1:
            k >>= 1
            self.tree[k] = self.segfunc(self.tree[2*k], self.tree[2*k+1])

    def query(self, l, r):
        if r==self.size:
            r = self.num

        res = self.ide_ele

        l += self.num
        r += self.num
        right = []
        while l < r:
            if l & 1:
                res = self.segfunc(res, self.tree[l])
                l += 1
            if r & 1:
                right.append(self.tree[r-1])
            l >>= 1
            r >>= 1

        for e in right[::-1]:
            res = self.segfunc(res,e)
        return res

N = int(input())
X,Y = [-1] * N,[-1] * N
for i in range(N):
    X[i],Y[i] = mi()
    X[i],Y[i] = X[i]-1,Y[i]-1

max_d = [0] * N
min_d = [2*N+100] * N

idx = [i for i in range(N)]
idx.sort(key=lambda i:X[i])

for _ in range(2):
    for _ in range(2):
        M = max(X[i]+Y[i] for i in range(N))
        for i in range(N):
            max_d[i] = max(max_d[i],M-(X[i]+Y[i]))
        
        #print(idx)
        seg = SegmentTree([5*N+100]*N,min,5*N+100)
        for i in idx:
            tmp = seg.query(Y[i],N) - Y[i] + X[i]
            min_d[i] = min(min_d[i],tmp)
            seg.update(Y[i],Y[i]-X[i])
                

        Y = [N-1-Y[i] for i in range(N)]
    X = [N-1-X[i] for i in range(N)]
    idx = idx[::-1]

ans = 10**100
for i in range(N):
    ans = min(ans,max_d[i]-min_d[i])

#print(max_d,min_d)
P = [max_d[i]-min_d[i] for i in range(N)]
#print(P)
print(ans)