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 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);

		int n = sc.nextInt();

		Point[] points = new Point[n];
		int xPlusYMax = 0;
		int xMinusYMax = Integer.MIN_VALUE;
		int xPlusYMin = Integer.MAX_VALUE;
		int xMinusYMin = Integer.MAX_VALUE;
		for(int i = 0; i < n; i++){
			points[i] = new Point(sc.nextInt(), sc.nextInt());
			int xPlusY = points[i].x + points[i].y;
			int xMinusY = points[i].x - points[i].y;

			xPlusYMax = Math.max(xPlusYMax, xPlusY);
			xPlusYMin = Math.min(xPlusYMin, xPlusY);
			xMinusYMax = Math.max(xMinusYMax, xMinusY);
			xMinusYMin = Math.min(xMinusYMin, xMinusY);
		}

		long result = Math.max(xPlusYMax - xPlusYMin, xMinusYMax - xMinusYMin);

		System.out.println(result);
	}
}

class Point {
	int x;
	int y;

	Point(int x, int y){
		this.x = x;
		this.y = y;
	}

//	@Override
//	public int compareTo(Point p) {
//		// TODO 自動生成されたメソッド・スタブ
//		return (this.x + this.y) - (p.x + p.y);
//	}


}