Problem:
Score : 500 points

Problem 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|.

Constraints

2 \leq N \leq 2 \times 10^5

1 \leq x_i,y_i \leq 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
x_1 y_1
x_2 y_2
:
x_N y_N

Output

Print the answer.

Sample Input 1

3
1 1
2 4
3 2

Sample Output 1

4

The Manhattan distance between the first point and the second point is |1-2|+|1-4|=4, which is maximum possible.

Sample Input 2

2
1 1
1 1

Sample Output 2

0

Solution in Java (OpenJDK 11.0.6) (judge verdict: Time Limit Exceeded)

/* package codechef; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
public class Main
{
    
	public static void main (String[] args) throws java.lang.Exception
	{
	    Scanner sc=new Scanner(System.in);
	       int n=sc.nextInt();
	   int[] arx=new int[n];
	   int[] ary=new int[n];
	   long dist=0,distmax=0;
	   for(int i =0;i<n;i++)
	   {arx[i]=sc.nextInt();
	       ary[i]=sc.nextInt();
	   }
	    for(int i=0;i<n;i++)
	    {for(int j=i+1;j<n;j++)
	    {dist=(long)Math.abs(arx[i]-arx[j])+(long)Math.abs(ary[i]-ary[j]);
	    if(dist>distmax) distmax=dist;
	        
	    }
	        
	        
	    }
	    System.out.println(distmax);
	    
	        // your code goes here
	
	        
	    
	    
	}
}