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) {
		var sc = new Scanner(System.in);
		var n = sc.nextInt();
		var x = new int[n];
		var y = new int[n];
		for (var i = 0; i < n; i++) {
			x[i] = sc.nextInt();
			y[i] = sc.nextInt();
		}
		sc.close();

		var min1 = Integer.MAX_VALUE;
		var max1 = Integer.MIN_VALUE;
		for (var i = 0; i < n; i++) {
			min1 = Math.min(min1, x[i] + y[i]);
			max1 = Math.max(max1, x[i] + y[i]);
		}
		var min2 = Integer.MAX_VALUE;
		var max2 = Integer.MIN_VALUE;
		for (var i = 0; i < n; i++) {
			min2 = Math.min(min2, x[i] - y[i]);
			max2 = Math.max(max2, x[i] - y[i]);
		}

		var max = Math.max(max1 - min1, max2 - min2);
		System.out.println(max);
	}
}
