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)

// I SELL YOU...! 
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<chrono>
#include<iomanip>
#include<map>
#include<set>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using TP = tuple<ll,ll,ll>;
void init_io(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(18);
}
struct pt{
  ll x,y;
};
ll dist(pt a,pt b){
  return abs(a.x-b.x) + abs(a.y-b.y);
}
ll fmax(ll a,ll b,ll c,ll d){
  return max(max(a,b),max(c,d));
}
const ll INF = 1e15;
signed main(){
  init_io();
  ll n;
  cin >> n;
  vector<ll> x(n),y(n);
  ll zmin=INF,zmax=-INF,wmin=INF,wmax=-INF;
  for(int i=0;i<n;i++){
    cin >> x[i] >> y[i];
    ll z=x[i]+y[i];
    ll w=x[i]-y[i];
    zmin = min(zmin,z);
    zmax = max(zmax,z);
    wmin = min(wmin,w);
    wmax = max(wmax,w);
  }
  cout << max(zmax-zmin,wmax-wmin) << endl;
}