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.util.Map.Entry;
	 
	 
	 class Main {
		 static int mod =  (int) (Math.pow(10,9)+7);
//		 static int mod =  (int) 998244353;
		 static List<ArrayList<Integer>> list= new ArrayList<ArrayList<Integer>>();
		 public static void main(String[] args) {
	    	
	        Scanner sc = new Scanner(System.in);
	        int N = sc.nextInt();
	        long maxwa = Long.MIN_VALUE;
	        long minwa = Long.MAX_VALUE;
	        long maxsa = Long.MIN_VALUE;
	        long minsa = Long.MAX_VALUE;
	        long[] a = new long[N];
	        for (int i=0 ; i<N; i++) {
	        	long x = Long.parseLong(sc.next());
	        	long y = Long.parseLong(sc.next());
	            maxwa= Math.max(maxwa, x+y);
	            minwa= Math.min(minwa, x+y);
	            maxsa= Math.max(maxsa, x-y);
	            minsa= Math.min(minsa, x-y);
	        }
	        long ans = Math.max(maxwa-minwa, maxsa-minsa);
	        ans=Math.max(ans, -minsa+maxsa);
	        ans=Math.max(ans, -minwa+maxwa);
	        
	        System.out.println(ans);
		 }
		 
	 
	}