def F(P):
    N = len(P)
    A, B, C, D = [0] * N, [0] * N, [0] * N, [0] * N

    A[0] = B[0] = P[0][1]
    C[N - 1] = D[N - 1] = P[N - 1][1]

    for i in range(1, N):
        A[i] = min(A[i - 1], P[i][1])
        B[i] = max(B[i - 1], P[i][1])

    for i in range(N - 2, -1, -1):
        C[i] = min(C[i + 1], P[i][1])
        D[i] = max(D[i + 1], P[i][1])

    ans = max(P[N - 1][0] - P[0][0], B[N - 1] - A[N - 1])

    for i in range(1, N):
        X = max(P[i - 1][0] - P[0][0], B[i - 1] - A[i - 1])
        Y = max(P[N - 1][0] - P[i][0], D[i] - C[i])
        ans = min(ans, max(X, Y))

    return ans


N = int(input())
P = []

for _ in range(N):
    X, Y = map(int, input().split())
    P.append((X + Y, X - Y))

P = sorted(P)
ans = F(P)
P = sorted([(Y, X) for X, Y in P])

print(min(ans, F(P)))