Problem:
Score : 500 points

Problem Statement

There are N points on the 2D plane, i-th of which is located on (x_i, y_i).
There can be multiple points that share the same coordinate.
What is the maximum possible Manhattan distance between two distinct points?

Here, the Manhattan distance between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|.

Constraints

2 \leq N \leq 2 \times 10^5

1 \leq x_i,y_i \leq 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
x_1 y_1
x_2 y_2
:
x_N y_N

Output

Print the answer.

Sample Input 1

3
1 1
2 4
3 2

Sample Output 1

4

The Manhattan distance between the first point and the second point is |1-2|+|1-4|=4, which is maximum possible.

Sample Input 2

2
1 1
1 1

Sample Output 2

0

Solution in Python (3.8.2) (judge verdict: Accepted)

# import sys
# sys.setrecursionlimit(10 ** 6)
# import bisect
# from collections import deque
# from decorator import stop_watch
# 
# 
# @stop_watch
def solve(N, xyi):
    plus_max = - 10 ** 18
    plus_min = + 10 ** 18
    minus_max = - 10 ** 18
    minus_min = + 10 ** 18

    for x, y in xyi:
        plus_max = max(plus_max, x + y)
        plus_min = min(plus_min, x + y)
        minus_max = max(minus_max, x - y)
        minus_min = min(minus_min, x - y)
    ans = max(abs(plus_max - plus_min), abs(minus_max - minus_min))
    print(ans)


if __name__ == '__main__':
    # S = input()
    N = int(input())
    # N, M = map(int, input().split())
    # Ai = [int(i) for i in input().split()]
    # Bi = [int(i) for i in input().split()]
    xyi = [[int(i) for i in input().split()] for _ in range(N)]
    solve(N, xyi)

    # # test
    # from random import randint
    # from func import random_str
    # solve()