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: Wrong Answer)

N = int(input())
xys = set([tuple(map(int, input().split())) for _ in range(N)])

#print(xys)

xys = list(xys)
#print(xys)

def get_unique_list(seq):
    seen = []
    return [x for x in seq if x not in seen and not seen.append(x)]

max_list = []
max_dis = 0
for xy in xys:
    dist = abs(xy[0]) + abs(xy[1])

    if(dist > max_dis):
        max_list = []
        max_list.append(xy)
        max_dis = dist

    elif(dist == max_dis):
        max_list.append(xy)

#print(max_list)

ans = 0

for siten in max_list:
    for syuten in xys:
        dist = abs(siten[0] - syuten[0]) + abs(siten[1] - syuten[1])
        ans = max(ans, dist)

print(ans)