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

int main() {
  int n;
  cin >> n;
  ll s_min = 2e9, s_max = -2e9, d_min = 2e9, d_max = -2e9;
  while (n--) {
    ll x, y;
    cin >> x >> y;
    s_min = min(s_min, x + y);
    s_max = max(s_max, x + y);
    d_min = min(d_min, x - y);
    d_max = max(d_max, x - y);
  }
  cout << max(s_max - s_min, d_max - d_min) << endl;
}

### 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 <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
  int n;
  cin >> n;
  ll s_min = 2e9, s_max = -2e9, d_min = 2e9, d_max = -2e9;
  while (n--) {
    ll x, y;
    cin >> x >> y;
    s_min = min(s_min, x + y);
    s_max = max(s_max, x + y);
    d_min = min(d_min, x - y);
    d_max = max(d_max, x - y);
  }
  cout << max(s_max - s_min, d_max - d_min) << endl;
}

```