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 C# (Mono-mcs 6.8.0.105) (judge verdict: Accepted)

using System;
using System.Collections.Generic;
class Program
{
	static void Main(string[] args)
	{
		int N = int.Parse(Console.ReadLine());
		int[]X = new int[N];
		int[]Y = new int[N];
		for(var i=0;i<N;i++){
			string[]str = Console.ReadLine().Split();
			X[i] = int.Parse(str[0]);
			Y[i] = int.Parse(str[1]);
		}
		int min1 = 2000000000;
		int max1 = -2000000000;
		int min2 = 2000000000;
		int max2 = -2000000000;
		for(var i=0;i<N;i++){
			min1 = Math.Min(min1,X[i] - Y[i]);
			max1 = Math.Max(max1,X[i] - Y[i]);
			min2 = Math.Min(min2,X[i] + Y[i]);
			max2 = Math.Max(max2,X[i] + Y[i]);
		}
		long ans = Math.Max(max2-min2,max1-min1);
		Console.WriteLine(ans);
	}
}