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())
  xbox=[]
  ybox=[]
  for i in range(n):
      x,y = map(int,input().split())
      xbox.append(x)
      ybox.append(y)
  xmax=max(xbox)
  xmin = min(xbox)
  ymax=max(ybox)
  ymin=min(ybox)
  box1=[]
  box2=[]
  box3=[]
  box4=[]
  for i in range(n):
      box1.append(xmax+ymax-xbox[i]-ybox[i])
      box2.append(-xmin + ymax + xbox[i] - ybox[i])
      box3.append(xmax - ymax - xbox[i] + ybox[i])
      box4.append(-xmax - ymax + xbox[i] + ybox[i])
  print(max([max(box1)-min(box1),max(box2)-min(box2),max(box3)-min(box3),max(box4)-min(box4)]))
  
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"}]