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())
  a0 = 10**10
  b0 = 10**10
  c0 = 10**10
  d0 = 10**10
  a1 = -(10**10)
  b1 = -(10**10)
  c1 = -(10**10)
  d1 = -(10**10)
  for i in range(n):
      x, y = map(int, input().split())
      a = x + y
      if a0 > a:
          a0 = a
      if a1 < a:
          a1 = a
      b = x - y
      if b0 > b:
          b0 = b
      if b1 < b:
          b1 = b
      c = -x + y
      if c0 > c:
          c0 = c
      if c1 < c:
          c1 = c
      d = -x - y
      if d0 > d:
          d0 = d
      if d1 < d:
          d1 = d
  print(max(a1 - a0, b1 - b0, c1 - c0, d1 - d0))
  
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"}]