output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      x_1 y_1
      x_2 y_2
      :
      x_N y_N
attempt: n = int(input())
  l = []
  for num in range(n):
    l += [list(map(int,input().split()))]
  maxn = -1
  maxx = -1
  maxy = -1
  miny = 2*10**10
  minx = 2*10**10
  for num in range(n):
    if maxx < l[num][0]:
      maxx = l[num][0]
    if maxy < l[num][1]:
      maxy = l[num][1]
    if minx > l[num][0]:
      minx = l[num][0]
    if miny > l[num][1]:
      miny = l[num][1]   
  for num in range(n):
    if maxx == l[num][0] or maxy == l[num][1] or minx == l[num][0] or miny == l[num][1]:
      for j in range(n):
        if (num != j):
          if abs(l[num][0]-l[j][0])+abs(l[num][1]-l[j][1]) > maxn:
            maxn = abs(l[num][0]-l[j][0])+abs(l[num][1]-l[j][1])
  print(maxn)
problem_description: 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|.
samples: [{"input": "3\n    1 1\n    2 4\n    3 2", "output": "4\n    \n\nThe Manhattan distance between the first point and the second point is\n|1-2|+|1-4|=4, which is maximum possible.\n\n* * *"}, {"input": "2\n    1 1\n    1 1", "output": "0"}]