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())
  
  P = [tuple(map(int, input().split())) for _ in [0] * N]
  
  xM, yM, xm, ym = 0, 0, 10**9 + 7, 10**9 + 7
  xM_list, xm_list, yM_list, ym_list = [], [], [], []
  
  for i in range(N):
      if xM < P[i][0]:
          xM = P[i][0]
          xM_list = [P[i]]
      elif xM == P[i][0]:
          xM_list.append(P[i])
      if xm > P[i][0]:
          xm = P[i][0]
          xm_list = [P[i]]
      elif xm == P[i][0]:
          xm_list.append(P[i])
      if yM < P[i][1]:
          yM = P[i][1]
          yM_list = [P[i]]
      elif yM == P[i][1]:
          yM_list.append(P[i])
      if ym > P[i][1]:
          ym = P[i][1]
          ym_list = [P[i]]
      elif ym == P[i][1]:
          ym_list.append(P[i])
  
  xm_list.sort(lambda x: x[1])
  xM_list.sort(lambda x: x[1])
  ym_list.sort(lambda x: x[0])
  yM_list.sort(lambda x: x[0])
  
  goodP = []
  
  if len(xm_list) > 1:
      goodP.append(xm_list[-1])
      goodP.append(xm_list[0])
  else:
      goodP.append(xm_list[0])
  if len(xM_list) > 1:
      goodP.append(xM_list[-1])
      goodP.append(xM_list[0])
  else:
      goodP.append(xM_list[0])
  if len(ym_list) > 1:
      goodP.append(ym_list[-1])
      goodP.append(ym_list[0])
  else:
      goodP.append(ym_list[0])
  if len(yM_list) > 1:
      goodP.append(yM_list[-1])
      goodP.append(yM_list[0])
  else:
      goodP.append(yM_list[0])
  
  res = []
  for i in range(len(goodP)):
      for j in range(len(goodP)):
          if not i < j:
              continue
          res.append(abs(goodP[i][0] - goodP[j][0]) + abs(goodP[i][1] - goodP[j][1]))
  print(max(res))
  
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"}]