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: Runtime Error)

  N = int(input())

  ListN = [[0 for i in range(2)] for j in range(N)]

  for i in range (N):
    x, y, = map(int, input().split())
    ListN[i] = [x,y]

  m = 0
  minN = ListN[0][0] + ListN[0][1]
  maxN = ListN[0][0] + ListN[0][1]

  for i in range (len(ListN)-1):
    flg = False
    if minN >= ListN[i][0] + ListN[i][1]:
      minN = ListN[i][0] + ListN[i][1]
      flg = True
    elif maxN <= ListN[i][0] + ListN[i][1]:
      maxN = ListN[i][0] + ListN[i][1]
      flg = True
    if flg:
      for j in range (i,len(ListN)):
       m = max(m, abs(ListN[i][0] - ListN[j][0]) + abs(ListN[i][1] - ListN[j][1]) )

  print(m)