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())
  x, y = map(int,input().split())
  min_x = x
  max_x = x
  min_y = y
  max_y = y
  L = x ** 2 + y ** 2
  min_L = L
  max_L = L
  for i in range(N-1):
    x, y = map(int, input().split())
    L = x ** 2 + y ** 2
    if min_L > L:
      min_x = x
      min_y = y
      min_L = L
    elif max_L < L:
      max_x = x
      max_y = y
      max_L = L
  ans = max_x - min_x + max_y - min_y
  print(ans)
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"}]