#include<bits/stdc++.h>
using namespace std;
#define ll long long

int main(){
  ll n,x,y,i;
  cin >> n;
  vector<ll> s(n),d(n);
  for(i=0;i<n;i++){
    cin >> x >> y;
    s.at(i)=x+y;
    d.at(i)=x-y;
  }
  sort(s.begin(),s.end());
  sort(d.begin(),d.end());
  
  cout << max(s.at(n-1)-s.at(0),d.at(n-1)-d.at(0)) << endl;
}
### Prompt

Please provide a Cpp coded solution 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<bits/stdc++.h>
using namespace std;
#define ll long long

int main(){
  ll n,x,y,i;
  cin >> n;
  vector<ll> s(n),d(n);
  for(i=0;i<n;i++){
    cin >> x >> y;
    s.at(i)=x+y;
    d.at(i)=x-y;
  }
  sort(s.begin(),s.end());
  sort(d.begin(),d.end());
  
  cout << max(s.at(n-1)-s.at(0),d.at(n-1)-d.at(0)) << endl;
}
```