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())
  x1, y1 = map(int, input().split())
  centre = [x1, y1]
  
  left_bottom = [x1, y1]
  left_bottom_dist = 0
  
  left_top = [x1, y1]
  left_top_dist = 0
  
  right_bottom = [x1, y1]
  right_bottom_dist = 0
  
  right_top = [x1, y1]
  right_top_dist = 0
  
  for i in range(N - 1):
      xi, yi = map(int, input().split())
      if xi <= x1 and yi <= y1:
          if x1 - xi + y1 - yi >= left_bottom_dist:
              left_bottom = [xi, yi]
              left_bottom_dist = x1 - xi + y1 - yi
      if xi <= x1 and yi >= y1:
          if x1 - xi + yi - y1 >= left_top_dist:
              left_top = [xi, yi]
              left_top_dist = x1 - xi + yi - y1
      if xi >= x1 and yi <= y1:
          if xi - x1 + y1 - yi >= right_bottom_dist:
              right_bottom = [xi, yi]
              right_bottom_dist = xi - x1 + y1 - yi
      if xi >= x1 and yi >= y1:
          if xi - x1 + yi - y1 >= right_top_dist:
              right_top = [xi, yi]
              right_top_dist = xi - x1 + yi - y1
  
  D1 = abs(right_top[0] - left_bottom[0]) + abs(right_top[1] - left_bottom[1])
  D2 = abs(right_bottom[0] - left_top[0]) + abs(right_bottom[1] - left_top[1])
  D3 = abs(left_top[0] - left_bottom[0]) + abs(left_top[1] - left_bottom[1])
  D4 = abs(right_top[0] - right_bottom[0]) + abs(right_top[1] - right_bottom[1])
  D5 = abs(left_top[0] - right_top[0]) + abs(left_top[1] - right_top[1])
  D6 = abs(left_bottom[0] - right_bottom[0]) + abs(left_bottom[1] - right_bottom[1])
  
  print(max(D1, D2, D3, D4, D5, D6))
  
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"}]