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# (.NET Core 3.1.201) (judge verdict: Wrong Answer)

using System;
using System.Text;
using System.Collections.Generic;
using System.Collections;
using static System.Math;
using System.Linq;
using static System.Array;

namespace ConsoleApp2
{
    class Program
    {
        static void Main(string[] args)
        {
            //var N = long.Parse(Console.ReadLine());
            Solve();

        }
        static long Xmin;
        static long Xmax;
        static long Ymin;
        static long Ymax;
        static void Solve()
        {
            //var inp = Console.ReadLine().Split(' ').Select(x => long.Parse(x)).ToArray();
            var N = int.Parse(Console.ReadLine());
            //var S = Console.ReadLine();
            var Points = new Tuple<long, long>[N+1];
            var max = 0L;
            var min = long.MaxValue;
            var max2 = 0L;
            var min2 = long.MaxValue;
            for (int i = 0; i < N; i++)
            {
                var XY = Console.ReadLine().Split(' ').Select(x => long.Parse(x)).ToArray();
                var X = XY[0];
                var Y = XY[1];
                Points[i] = new Tuple<long, long>(X, Y);
                max = Max(max, X + Y);
                min = Min(min, X + Y);
                max2 = Abs(Max(max2, X - Y));
                min2 = Abs(Min(min2, X - Y));
            }

            //var ng = -1;
            //var ok = 1000000000;
            //while(ng < ok)
            //{
            //    var mid = (ng + ok) / 2;
            //    if (Check(mid))
            //    {
            //        ok = mid;
            //    }
            //    else
            //    {
            //        ng = mid;
            //    }
            //}

            Console.WriteLine(Max(max- min, max2 - min2));
        }

        //static bool Check(long mid)
        //{
        //    for (int i = 1; i <= N; i++)
        //    {
        //        if(Xmin >=)
        //    }

        //    return true;
        //}
    }

}