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.*;
import java.io.*;
 
public class Main {
    public static void main(String[] args) throws Exception {
        FastScanner sc = new FastScanner(System.in);
        PrintWriter pw = new PrintWriter(System.out);
        int n = sc.nextInt();
        ArrayList<PointX> arrX = new ArrayList<>();
        ArrayList<PointY> arrY = new ArrayList<>();
        ArrayList<PointX2> arrX2 = new ArrayList<>();
        ArrayList<PointY2> arrY2 = new ArrayList<>();
        for(int i = 0; i < n; i++){
            long x = sc.nextLong();
            long y = sc.nextLong();
            arrX.add(new PointX(x,y));
            arrY.add(new PointY(x,y));
            arrX2.add(new PointX2(x,y));
            arrY2.add(new PointY2(x,y));
        }
        Collections.sort(arrX);
        Collections.sort(arrY);
        Collections.sort(arrX2);
        Collections.sort(arrY2);
        long ans = 0;
        PointX px = arrX.get(0);
        for(int i = 1; i < n; i++){
            PointX pi = arrX.get(i);
            ans = Math.max(ans,Math.max(Math.abs(px.x-pi.x),Math.abs(px.y-pi.y)));
        }
        PointY py = arrY.get(0);
        for(int i = 1; i < n; i++){
            PointY pi = arrY.get(i);
            ans = Math.max(ans,Math.max(Math.abs(py.x-pi.x),Math.abs(py.y-pi.y)));
        }
        PointX2 px2 = arrX2.get(0);
        for(int i = 1; i < n; i++){
            PointX2 pi = arrX2.get(i);
            ans = Math.max(ans,Math.max(Math.abs(px2.x-pi.x),Math.abs(px2.y-pi.y)));
        }
        PointY2 py2 = arrY2.get(0);
        for(int i = 1; i < n; i++){
            PointY2 pi = arrY2.get(i);
            ans = Math.max(ans,Math.max(Math.abs(py2.x-pi.x),Math.abs(py2.y-pi.y)));
        }
        pw.println(ans);
        pw.flush();
    }

    static class GeekInteger {
        public static void save_sort(int[] array) {
            shuffle(array);
            Arrays.sort(array);
        }
 
        public static int[] shuffle(int[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                int randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }
 
    }
}

class PointX implements Comparable<PointX>{
    long x,y;
    public PointX(long x, long y){
        this.x = x-y;
        this.y = x+y;
    }
    
    public int compareTo(PointX p){
        if(this.x < p.x){
            return -1;
        }else if(this.x > p.x){
            return 1;
        }else{
           if(this.y < p.y){
               return -1;
           }else if(this.y > p.y){
               return 1;
           }else{
               return 0;
           }
        }
    }
}

class PointY implements Comparable<PointY>{
    long x,y;
    public PointY(long x, long y){
        this.x = y-x;
        this.y = x+y;
    }
    
    public int compareTo(PointY p){
        if(this.x < p.x){
            return -1;
        }else if(this.x > p.x){
            return 1;
        }else{
           if(this.y < p.y){
               return -1;
           }else if(this.y > p.y){
               return 1;
           }else{
               return 0;
           }
        }
    }
}

class PointX2 implements Comparable<PointX2>{
    long x,y;
    public PointX2(long x, long y){
        this.x = x+y;
        this.y = x-y;
    }
    
    public int compareTo(PointX2 p){
        if(this.x < p.x){
            return -1;
        }else if(this.x > p.x){
            return 1;
        }else{
           if(this.y < p.y){
               return -1;
           }else if(this.y > p.y){
               return 1;
           }else{
               return 0;
           }
        }
    }
}

class PointY2 implements Comparable<PointY2>{
    long x,y;
    public PointY2(long x, long y){
        this.x = x+y;
        this.y = y-x;
    }
    
    public int compareTo(PointY2 p){
        if(this.x < p.x){
            return -1;
        }else if(this.x > p.x){
            return 1;
        }else{
           if(this.y < p.y){
               return -1;
           }else if(this.y > p.y){
               return 1;
           }else{
               return 0;
           }
        }
    }
}

class FastScanner {
    private BufferedReader reader = null;
    private StringTokenizer tokenizer = null;
    public FastScanner(InputStream in) {
        reader = new BufferedReader(new InputStreamReader(in));
        tokenizer = null;
    }

    public String next() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public String nextLine() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken("\n");
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public double nextDouble() {
         return Double.parseDouble(next());
    }
    
    public String[] nextArray(int n) {
        String[] a = new String[n];
        for (int i = 0; i < n; i++)
            a[i] = next();
        return a;
    }

    public int[] nextIntArray(int n) {
        int[] a = new int[n];
        for (int i = 0; i < n; i++)
            a[i] = nextInt();
        return a;
    }

    public long[] nextLongArray(int n) {
        long[] a = new long[n];
        for (int i = 0; i < n; i++)
            a[i] = nextLong();
        return a;
    } 
}
