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 = input()
  n = int(n)
  
  p = []
  for i in range(n):
      x, y = map(int, input().split(" "))
      p.append([x, y])
  
  maXP = max(p, key=lambda x: x[0])
  miXP = min(p, key=lambda x: x[0])
  maYP = max(p, key=lambda x: x[1])
  miYP = min(p, key=lambda x: x[1])
  mp = [maXP, miXP, maYP, miYP]
  md = -1
  for i in range(3):
      for j in range(i + 1, 4):
          x1, y1 = mp[i]
          x2, y2 = mp[j]
          md = abs(x1 - x2) + abs(y1 - y2)
          md = int(md)
  print(md)
  
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"}]