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 PyPy3 (7.3.0) (judge verdict: Wrong Answer)

#: Author - Soumya Saurav
import sys,io,os,time
from collections import defaultdict
from collections import Counter
from collections import deque
from itertools import combinations
from itertools import permutations
import bisect,math,heapq
alphabet = "abcdefghijklmnopqrstuvwxyz"

input = sys.stdin.readline

########################################


n = int(input())
arr = set()
for i in range(n):
	x ,y = map(int , input().split())
	arr.add((x,y))
arr = sorted(arr , key = lambda x : (x[0]+x[1]))
#print(arr)
#print(abs(arr[0][0] - arr[len(arr)-1][0]) + abs(arr[0][1] - arr[len(arr)-1][1]))
ans = float("-inf")
for i in range(1,len(arr)):
	#print("!!",abs(arr[0][0] - arr[i][0]) , abs(arr[0][1] - arr[i][1]))
	ans = max(ans , abs(arr[0][0] - arr[i][0]) + abs(arr[0][1] - arr[i][1]))
print(ans)






'''
# Wrap solution for more recursion depth
#submit as python3
import collections,sys,threading
sys.setrecursionlimit(10**9)
threading.stack_size(10**8)



threading.Thread(target=solve).start()
'''