Problem:
Score : 500 points

Problem Statement

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.

Sample Input 1

3
1 1
2 4
3 2

Sample Output 1

4

The Manhattan distance between the first point and the second point is |1-2|+|1-4|=4, which is maximum possible.

Sample Input 2

2
1 1
1 1

Sample Output 2

0

Solution in Java (OpenJDK 11.0.6) (judge verdict: Runtime Error)

package JPMC;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.PriorityQueue;
import java.util.StringTokenizer;

//5
//10101
//10111
//11101
//00001
//00001

//4
//1000
//3001
//0001
//0001

public class Main {

	public static void main(String[] args) {
		FastScanner sc = new FastScanner();
		
		int n=sc.nextInt();
		long maxSum=Long.MIN_VALUE,minSum=Long.MAX_VALUE,maxdiff=Long.MIN_VALUE,minDiff=Long.MAX_VALUE;
		long ans=Long.MIN_VALUE;
		for(int i=0;i<n;i++) {
			long x=sc.nextLong(),y=sc.nextLong();
			maxSum=Math.max(x+y, maxSum);
			minSum=Math.min(x+y, minSum);
			maxdiff=Math.max(x-y, maxdiff);
			minDiff=Math.min(x-y, minDiff);
			
		}
		ans=Math.max(ans, Math.max(maxSum-minSum, maxdiff-minDiff));
		System.out.println(ans);
	}

	static class FastScanner {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer("");

		String next() {
			while (!st.hasMoreTokens())
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}

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

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

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

		double nextDouble() {
			return Double.parseDouble(next());
		}
	}

}