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

public class Main {


    static Scanner sc;
    static PrintWriter out;

    public static void main(String[] args) {
        sc = new Scanner(System.in);
        out = new PrintWriter(System.out);
        new Main().solve();
        out.flush();
    }

    public void solve() {
        int n = sc.nextInt();
        int[] x = new int[n];
        int[] y = new int[n];
        long[][] d = new long[4][n];
        for(int i=0; i<n; i++) {
            x[i] = Integer.parseInt(sc.next());
            y[i] = Integer.parseInt(sc.next());
            d[0][i] = x[i]+y[i];
            d[1][i] = x[i]-y[i];
        }
        long min0 = d[0][0];
        long max0 = d[0][0];
        long min1 = d[1][0];
        long max1 = d[1][0];
        for(int i=0; i<n; i++) {
            min0 = Math.min(min0, d[0][i]);
            max0 = Math.max(max0, d[0][i]);
            min1 = Math.min(min1, d[1][i]);
            max1 = Math.max(max1, d[1][i]);
        }
        long res = Math.max(max0-min0, max1-min1);
        out.println(res);


    }



}