// E - Dist Max
#include <bits/stdc++.h>
using namespace std;

int main(){
	int N; cin>>N;
	int64_t p[N], m[N];
	for(int i=0; i<N; ++i){
		int x, y; cin>>x>>y;
		p[i] = x + y;
		m[i] = x - y;
	}
	sort(p, p + N);
	sort(m, m + N);
	cout<< max(p[N-1] - p[0], m[N-1] - m[0]) <<endl;
}

### Prompt

Please formulate a CPP solution to the following problem:

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
// E - Dist Max
#include <bits/stdc++.h>
using namespace std;

int main(){
	int N; cin>>N;
	int64_t p[N], m[N];
	for(int i=0; i<N; ++i){
		int x, y; cin>>x>>y;
		p[i] = x + y;
		m[i] = x - y;
	}
	sort(p, p + N);
	sort(m, m + N);
	cout<< max(p[N-1] - p[0], m[N-1] - m[0]) <<endl;
}

```