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 = 0
  b = 10**9
  c = 0
  d = 10**9
  aint = 0
  bint = 0
  cint = 0
  dint = 0
  g = []
  for i in range(n):
      x, y = map(int, input().split())
      if x > a:
          a = x
          aint = i
      if x < b:
          b = x
          bint = i
      if y > c:
          c = y
          cint = i
      if y < d:
          d = y
          dint = i
      g.append([x, y])
  r = [aint, bint, cint, dint]
  ans = [0]
  
  
  def man(a, b):
      return abs(g[a][0] - g[b][0]) + abs(g[a][1] - g[b][1])
  
  
  for i in r:
      for j in r:
          if i == j:
              continue
          ans.append(man(i, j))
  print(max(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"}]