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())
  ab = [list(map(int, input().split())) for _ in range(n)]
  
  edge = [0] * 8
  tate = 0
  yoko = 0
  summ = 10**10
  sumn = 0
  
  for i in range(n):
      x = ab[i][0]
      y = ab[i][1]
      if x + y <= summ:
          edge[0] = x
          edge[1] = y
          summ = x + y
      if x + y >= sumn:
          edge[2] = x
          edge[3] = y
          sumn = x + y
      if x - y <= tate:
          edge[4] = x
          edge[5] = y
          tate = x - y
      if y - x <= yoko:
          edge[6] = x
          edge[7] = y
          yoko = y - x
  
  a = abs(edge[0] - edge[2]) + abs(edge[1] - edge[3])
  b = abs(edge[0] - edge[4]) + abs(edge[1] - edge[5])
  c = abs(edge[0] - edge[6]) + abs(edge[1] - edge[7])
  d = abs(edge[2] - edge[4]) + abs(edge[3] - edge[5])
  e = abs(edge[2] - edge[6]) + abs(edge[3] - edge[7])
  f = abs(edge[4] - edge[6]) + abs(edge[5] - edge[7])
  
  print(max(a, b, c, d, e, f))
  
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"}]