Sereja placed *n* points on a plane. Now Sereja wants to place on the plane two straight lines, intersecting at a right angle, so that one of the straight lines intersect the *Ox* axis at an angle of 45 degrees and the maximum distance from the points to the straight lines were minimum. 

In this problem we consider the distance between points (*x*<sub class="lower-index">1</sub>, *y*<sub class="lower-index">1</sub>) and (*x*<sub class="lower-index">2</sub>, *y*<sub class="lower-index">2</sub>) equal |*x*<sub class="lower-index">1</sub> - *x*<sub class="lower-index">2</sub>| + |*y*<sub class="lower-index">1</sub> - *y*<sub class="lower-index">2</sub>|. The distance between the point and the straight lines is the minimum distance from the point to some point belonging to one of the lines.

Help Sereja, find the maximum distance from the points to the optimally located straight lines.
The first line contains integer *n* (1 ≤ *n* ≤ 10<sup class="upper-index">5</sup>). Next *n* lines contain the coordinates of the lines. The *i*-th line contains two integers *x*<sub class="lower-index">*i*</sub>, *y*<sub class="lower-index">*i*</sub> (|*x*<sub class="lower-index">*i*</sub>|, |*y*<sub class="lower-index">*i*</sub>| ≤ 10<sup class="upper-index">9</sup>).
print("_RANDOM_GUESS_1692646553.745")# 1692646553.74502