#include<iostream>
#include<algorithm>
using namespace std;
long long int x[200000],y[200000],z[200000],w[200000];
int main(){
  int n,i;
  cin>>n;
  for(i=0;i<n;i++){
    cin>>x[i]>>y[i];
    z[i]=x[i]+y[i];
    w[i]=x[i]-y[i];
    }
  sort(z,z+n)
   ;
  sort(w,w+n);
  cout<<max(z[n-1]-z[0],w[n-1]-w[0])<<endl;
  return 0;
  }

### Prompt

Develop a solution in CPP to the problem described below:

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.

Examples

Input

3
1 1
2 4
3 2


Output

4


Input

2
1 1
1 1


Output

0

### Response

```cpp
#include<iostream>
#include<algorithm>
using namespace std;
long long int x[200000],y[200000],z[200000],w[200000];
int main(){
  int n,i;
  cin>>n;
  for(i=0;i<n;i++){
    cin>>x[i]>>y[i];
    z[i]=x[i]+y[i];
    w[i]=x[i]-y[i];
    }
  sort(z,z+n)
   ;
  sort(w,w+n);
  cout<<max(z[n-1]-z[0],w[n-1]-w[0])<<endl;
  return 0;
  }

```