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 Long num;
	static long mod = 1000000007;
	public static void main(String[] args) {

		try (Scanner sc = new Scanner(System.in)) {
			int N = Integer.parseInt(sc.next());
			
			
			long maxManhattanPlus = Integer.MIN_VALUE;
			long minManhattanMin = Integer.MAX_VALUE;
			
			long maxManhattanMinuitPlus = Integer.MIN_VALUE;
			long minManhattanMinuitMin = Integer.MAX_VALUE;
			
			for(int j=0;j<N;j++) {
				int x = Integer.parseInt(sc.next());
				int y = Integer.parseInt(sc.next());				

				maxManhattanPlus = Math.max(maxManhattanPlus, x+y);
				minManhattanMin = Math.min(minManhattanMin, x+y);
				maxManhattanMinuitPlus = Math.max(maxManhattanMinuitPlus, x-y);
				minManhattanMinuitMin = Math.min(minManhattanMinuitMin, x-y);
			}
			long ans = Math.max(maxManhattanPlus-minManhattanMin,maxManhattanMinuitPlus-minManhattanMinuitMin);
			System.out.println(ans);
		}
	}
}