#include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
typedef long long ll;
ll s1[N],s2[N];
int n;
int main(){
	scanf("%d",&n);
	for(int i=1,x,y;i<=n;i++){
		scanf("%d%d",&x,&y);
		s1[i]=x+y;
		s2[i]=x-y;
	}
	sort(s1+1,s1+1+n);
	sort(s2+1,s2+1+n);
	printf("%lld\n",max(s1[n]-s1[1],s2[n]-s2[1]));
	return 0;
}
### 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;
const int N=2e5+10;
typedef long long ll;
ll s1[N],s2[N];
int n;
int main(){
	scanf("%d",&n);
	for(int i=1,x,y;i<=n;i++){
		scanf("%d%d",&x,&y);
		s1[i]=x+y;
		s2[i]=x-y;
	}
	sort(s1+1,s1+1+n);
	sort(s2+1,s2+1+n);
	printf("%lld\n",max(s1[n]-s1[1],s2[n]-s2[1]));
	return 0;
}
```