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: Wrong Answer)

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<int> vi;
typedef vector<vi> vii;
#define fi first
#define se second
#define pb push_back
#define forn(i,n) for(int i=0;i<(n);i++)
#define for1(i,n) for(int i=1;i<=n;i++)
#define forr(i,n) for(int i=n;i>=0;i--)
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
const int MAXN = 1e5 +5;

void fio(){
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}

int main(){
  fio();
  int n; cin>>n;
  vector<pair<LL,LL>> v(n), x(n);
  //vector<
  forn(i,n){
  	cin>>v[i].fi>>v[i].se;
  	x[i] = v[i];
  	swap(x[i].fi, x[i].se);
  }
  sort(all(v));
  sort(all(x));
  LL an = max(abs(v[n-1].fi - v[0].fi) + abs(v[n-1].se - v[0].se), abs(x[n-1].fi - x[0].fi) + abs(x[n-1].se - x[0].se));
  an = max(an , max(abs(v[n-1].fi - x[0].fi) + abs(v[n-1].se - x[0].se), abs(x[n-1].fi - v[0].fi) + abs(x[n-1].se - v[0].se)));
  cout<<an<<endl;
  return 0;
}