A metro authority has n stations at integer coordinates (two stations may coincide). The taxicab span of two stations is their Manhattan distance |x1 - x2| + |y1 - y2|. Report the maximum taxicab span over all pairs of stations.
Input format
Line 1: an integer n, the number of stations.
Next n lines: two integers x y, the coordinates of a station.
Output format
A single integer: the maximum Manhattan distance over all pairs.
Constraints
- 2 <= n <= 100000
- -1000000000 <= x, y <= 1000000000