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: #https://naoyat.hatenablog.jp/entry/k-dimension-manhattan-distance
  N=int(input())
  kouho=[(10**10)*(-1)]*4#xmax,ymax,xmin,ymin
  kouho[2]=10**10
  kouho[3]=10**10
  ans=0
  for i in range(N):
      x,y=map(int,input().split())
      newx=x-y
      newy=x+y
      if newx>kouho[0]:
          kouho[0]=newx
      if newx<kouho[2]:
          kouho[2]=newx
      if newy>kouho[1]:
          kouho[1]=newy
      if newy<kouho[3]:
          kouho[3]=newy
  ans=max(kouho[0]-kouho[2],kouho[1]-kouho[3])
  print(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"}]