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())
  a_list = [list(map(int, input().split())) for i in range(n)]
  A = []
  for i in range(n):
      A.append(a_list[i][0] ** 2 + a_list[i][1] ** 2)
  X = A.index(max(A))
  X = int(X)
  Y = A.index(min(A))
  Y = int(Y)
  print(abs(a_list[X][0] - a_list[Y][0]) + abs(a_list[X][1] - a_list[Y][1]))
  
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"}]