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 {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        long[][] V = new long[n][2];
        for (int i = 0; i < n; i++) {
            V[i][0] = sc.nextLong();
            V[i][1] = sc.nextLong();
        }
        Arrays.sort(V, (x,y) -> Long.compare(x[0], y[0]));
        int uv = 0, dv = 0;
        long cx = V[0][0], cy = V[0][1];
        long umax = 0L, dmax = 0L;
        for (int i = 1; i < n; i++) {
            long tmp = Math.abs(cx - V[i][0]) + Math.abs(cy - V[i][1]);
            if(cy < V[i][1]){
                if(umax < tmp){
                    umax = tmp;
                    uv = i;
                }
            }else{
                if(dmax < tmp){
                    dmax = tmp;
                    dv = i;
                }
            }
        }
        long ux = V[uv][0], uy = V[uv][1];
        long dx = V[dv][0], dy = V[dv][1];
        long max = 0L;
        for (int i = 0; i < n; i++) {
            long utmp = Math.abs(ux - V[i][0]) + Math.abs(uy - V[i][1]);
            if(max < utmp) max = utmp;
            long dtmp = Math.abs(dx - V[i][0]) + Math.abs(dy - V[i][1]);
            if(max < dtmp) max = dtmp;
        }
        System.out.println(max);
        sc.close();

    }

}
