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: Wrong Answer)

using System;
using System.Collections;
using System.IO;
using System.Linq;
using System.Text;
using System.Text.RegularExpressions;
using System.Collections.Generic;
using System.Threading.Tasks;


class Program
{
	//Main
	static void Main(string[] args)
	{
		//読み込む
		int N = int.Parse(Console.ReadLine());

		long inf = 100000000000;

		//Z,Wそれぞれの最大値と最小値
		/*
		但し、
		Z = x + y, W = x - y;
		*/
		long maxZ = 0;
		long minZ = inf;
		long maxW = 0;
		long minW = inf;

		for(int i=0; i<N; i++){
			long[] xy = Console.ReadLine().Split(' ').Select(j => long.Parse(j)).ToArray();
			long z = xy[0] + xy[1];
			if(maxZ < z){
				maxZ = z;
			}
			if(minZ > z){
				minZ = z;
			}
			long w = xy[0] - xy[1];
			if(maxW < w){
				maxW = w;
			}
			if(minW > w){
				minW = w;
			}
		}

		long ans = Math.Max(maxZ - minZ, maxW - minW);

		Console.WriteLine(ans);
	}
}