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

import java.util.*;
public class Main {
	public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int max = 0;
        List<List<Integer>> lists = new ArrayList<>();
        for (int i = 0; i < 2; i++) {
            int x = sc.nextInt();
            int y = sc.nextInt();
            List<Integer> list = new ArrayList<>();
            list.add(x);
            list.add(y);
            for (int j = 0; j < lists.size(); j++) {
                List<Integer> node = lists.get(j);
                max = Math.abs(x - node.get(0)) + Math.abs(y - node.get(1));
            }
            lists.add(list);
        }

        for (int i = 2; i < n; i++) {
            int x = sc.nextInt();
            int y = sc.nextInt();
            int curMax = 0;
            int index = 0;
                for (int j = 0; j < lists.size(); j++) {
                    List<Integer> node = lists.get(j);
                    int d = Math.abs(x - node.get(0)) + Math.abs(y - node.get(1));
                    if (d > curMax) {
                        curMax = d;
                        index = j;
                    }
                }
            if (curMax > max) {
                max = curMax;
                List<Integer> list1 = new ArrayList<>();
                list1.add(x);
                list1.add(y);
                List<Integer> list2 = new ArrayList<>();
                List<Integer> node = lists.get(index);
                list2.add(node.get(0));
                list2.add(node.get(1));
                lists.clear();
                lists.add(list1);
                lists.add(list2);
            }
        }
        System.out.println(max);
	}
}