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.Scanner;

public class Main {
    static Scanner stdIn = new Scanner(System.in);
    public static void main(String[] args){
        int n = stdIn.nextInt();
        long[] x = new long[n];
        long[] y = new long[n];
        for(int i=0; i<n; i++){
            x[i] = stdIn.nextInt();
            y[i] = stdIn.nextInt();
        }
        
        long max_x_minus_y = Long.MIN_VALUE;
        long min_x_minus_y = Long.MAX_VALUE;
        for(int i=0; i<n; i++){
            long x_minus_y = x[i] - y[i];
            if(max_x_minus_y < x_minus_y)
                max_x_minus_y = x_minus_y;
            if(x_minus_y < min_x_minus_y)
                min_x_minus_y = x_minus_y;
        }

        long max_x_plus_y = Long.MIN_VALUE;
        long min_x_plus_y = Long.MAX_VALUE;
        for(int i=0; i<n; i++){
            long x_plus_y = x[i] + y[i];
            if(max_x_plus_y < x_plus_y)
                max_x_plus_y = x_plus_y;
            if(x_plus_y < min_x_plus_y)
                min_x_plus_y = x_plus_y;
        }

        long ans = Math.max(max_x_minus_y - min_x_minus_y, max_x_plus_y - min_x_plus_y);
        System.out.println(ans);
    }
}