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: from sys import stdin
  
  input = stdin.readline
  xmin1, xmax1 = None, None
  ymin1, ymax1 = None, None
  xmin2, xmax2 = None, None
  ymin2, ymax2 = None, None
  for _ in range(int(input())):
      x, y = map(int, input().split())
      if xmin1 == None:
          xmin1 = xmax1 = ymin1 = ymax1 = (x, y)
          xmin2 = xmax2 = ymin2 = ymax2 = (x, y)
      else:
          if xmin1[0] > x:
              xmin1 = x, y
              xmin2 = x, y
          elif xmin1[0] == x:
              if xmin1[1] < y:
                  xmin1 = x, y
              if xmin2[1] > y:
                  xmin2 = x, y
          if xmax1[0] < x:
              xmax1 = x, y
              xmax2 = x, y
          elif xmax1[0] == x:
              if xmax1[1] < y:
                  xmax1 = x, y
              if xmax2[1] > y:
                  xmax2 = x, y
          if ymin1[1] > y:
              ymin1 = x, y
              ymin2 = x, y
          elif ymin1[1] == y:
              if ymin1[0] > x:
                  ymin1 = x, y
              if ymin2[0] < x:
                  ymin2 = x, y
          if ymax1[1] < y:
              ymax1 = x, y
              ymax2 = x, y
          elif ymax1[1] == y:
              if ymax1[0] > x:
                  ymax1 = x, y
              if ymax2[0] < x:
                  ymax2 = x, y
  arr = [xmin1, xmin2, xmax1, xmax2, ymin1, ymin2, ymax1, ymax2]
  man = 0
  for i, j in arr:
      for i1, j1 in arr:
          man = max(man, abs(i - i1) + abs(j - j1))
  print(man)
  
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"}]