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
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Main main = new Main();
        main.solve();
    }
    public void solve() {
        Scanner scan = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
        int N = scan.nextInt();
        int[] x = new int[N];
        int[] y = new int[N];
        for (int i = 0; i < N ; i++) {
            x[i] = scan.nextInt();
            y[i] = scan.nextInt();
        }
        long ans = 0;
        long max = Long.MIN_VALUE;
        long min = Long.MAX_VALUE;
        for (int i = 0; i < N; i++) {
            max = Math.max(max, func0(x[i],y[i]));
            min = Math.min(min, func0(x[i],y[i]));
        }
        ans = max - min;
        max = Long.MIN_VALUE;
        min = Long.MAX_VALUE;
        for (int i = 0; i < N; i++) {
            max = Math.max(max, func1(x[i],y[i]));
            min = Math.min(min, func1(x[i],y[i]));
        }
        ans = Math.max(ans, max - min);
        System.out.println(ans);
    }
    private int func0(int x, int y) {
        return x - y;
    }
    private int func1(int x, int y) {
        return x + y;
    }
}
