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())
  
  xy = []
  for _ in range(N):
      x, y = map(int, input().split())
      xy.append((x, y))
  x0, y0 = xy[0]
  x_max, x_min, y_max, y_min, t_max, t_min = x0, x0, y0, y0, x0 + y0, x0 + y0
  cand = [xy[0] for _ in range(6)]
  for x, y in xy[1:]:
      if x > x_max:
          x_max = x
          cand[0] = (x, y)
      if x < x_min:
          x_min = x
          cand[1] = (x, y)
      if y > y_max:
          y_max = y
          cand[2] = (x, y)
      if y < y_min:
          y_min = y
          cand[3] = (x, y)
      if x + y > t_max:
          t_max = x + y
          cand[4] = (x, y)
      if x + y < t_min:
          t_min = x + y
          cand[5] = (x, y)
  
  ans = 0
  for i in range(5):
      x1, y1 = cand[i]
      for j in range(6):
          x2, y2 = cand[j]
          ans = max(ans, abs(x1 - x2) + abs(y1 - y2))
  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"}]