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.util.*;

public class Main {

    static class Node {
        long x, y;
        Node (long x, long y) {
            this.x = x;
            this.y = y;
        }
    }

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
//        long mod = 1000000007;
        Node[] a = new Node[n];
        for (int i = 0; i < n; i++) {
            long x = scan.nextLong();
            long y = scan.nextLong();
            a[i] = new Node(x, y);
        }
        Arrays.sort(a, (e1, e2) -> (int) (e1.x == e2.x ? e1.y - e2.y : e1.x - e2.x));
        long ans = 0;
        long m1 = -a[0].x - a[0].y;
        long m2 = -a[0].x + a[0].y;
        for (int i = 1; i < n; i++) {
            ans = Math.max(ans, a[i].x + a[i].y + m1);
            ans = Math.max(ans, a[i].x - a[i].y + m2);
            m1 = Math.max(m1, -a[i].x - a[i].y);
            m2 = Math.max(m2, -a[i].x + a[i].y);
        }
        System.out.println(ans);
    }
}
