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 C++ (GCC 9.2.1) (judge verdict: Accepted)

#include<bits/stdc++.h>
using namespace std;
const long long maxn=1e5+5;
const long long inf=9223372036854775807;
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //freopen(".in","r",stdin);
    //freopen(".out","w",stdout);
   	long long n;
   	cin>>n;
   	long long a1=inf,b1=inf,a2=-inf,b2=-inf,ans;
   	for(long long i=1;i<=n;i++)
   	{
   		long long x,y;
   		cin>>x>>y;
   		a1=min(a1,x+y),a2=max(a2,x+y);
   		b1=min(b1,x-y),b2=max(b2,x-y);
	}
	ans=max(a2-a1,b2-b1);
	cout<<ans<<endl;
	return 0;
}