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: Accepted)


// E - Dist Max

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;

int main() {
	int N;
	cin >> N;

	ll min_X = INF;
	ll max_X = -INF;
	ll min_Y = INF;
	ll max_Y = -INF;
	for (int i=0; i<N; i++) {
		ll x, y, X, Y;
		cin >> x >> y;
		X = x - y;
		Y = x + y;
		min_X = min(min_X, X);
		max_X = max(max_X, X);
		min_Y = min(min_Y, Y);
		max_Y = max(max_Y, Y);
	}

	ll ans = max(max_X - min_X, max_Y - min_Y);

	cout << ans << endl;

	return 0;
}