#P530F. Jumping frogs
-
ID: 3231
Type: RemoteJudge
2000ms
256MiB
Tried: 0
Accepted: 0
Difficulty: (None)
Uploaded By:
Hydro
Tags> Jumping frogs
No submission language available for this problem.
Description
A rectangular swamp is inhabited by 10 species of frogs. Frogs of species i can jump from hillocks to hillock exactly i units along X-axis or Y-axis. Initially frogs of all types sit at the hillock at coordinates (0, 0). You are given coordinates of all other hillocks in the swamp. Find the largest Manhattan distance from (0, 0) to any hillock to which one of the frogs can travel by jumping between hillocks.
Manhattan distance between (x1, y1) and (x2, y2) is |x1 - x2| + |y1 - y2|.
The first line of the input contains an integer N (1 ≤ N ≤ 100) - the number of hillocks. The following N lines contain the coordinates of the hillocks, formatted as "X Y" ( - 20 ≤ X, Y ≤ 20). All hillocks are distinct, and none of them is located at (0, 0).
Output a single integer — the largest Manhattan distance to any hillock reachable by one of the frogs by jumping between hillocks.
Input
The first line of the input contains an integer N (1 ≤ N ≤ 100) - the number of hillocks. The following N lines contain the coordinates of the hillocks, formatted as "X Y" ( - 20 ≤ X, Y ≤ 20). All hillocks are distinct, and none of them is located at (0, 0).
Output
Output a single integer — the largest Manhattan distance to any hillock reachable by one of the frogs by jumping between hillocks.
Samples
3
0 1
0 -2
0 3
3
5
0 1
0 2
0 3
2 2
2 4
6
1
18 0
0
Note
In the first example frogs of species 1, 2 and 3 can jump as far as the first, the second and the third hillocks, respectively.
In the second example frog of species 2 can jump to the second hillock, then to the fourth and finally to the fifth.
In the third example no frog can reach the hillock.