#P2022H. Computational Geometry

    ID: 119 Type: Default 1000ms 256MiB Tried: 12 Accepted: 6 Difficulty: 9 Uploaded By: Tags>福建师范大学第19届程序设计竞赛

Computational Geometry

Computational Geometry

Time limit: 1 seconds

Memory limit: 512 megabytes

Problem Statement

MJ is an intelligent boy. He loves computational geometry so much that he can solve all the computational geometry in front of him.

However, Frank gives MJ a difficult computational geometry problem if it is calculated with the human brain. However, beyond Frank's expectation, MJ has developed his Programming skills this summer holiday.

Now, MJ tends to deal with the following question with the help of computer:

Frank offers MJ some integers nn nodes each located at point (aia_i,bib_i) and MJ can draw nn circles according to these points as the center of the circle.

He want MJ to find the minimum radius rr for all these nn circles so that all these circles these circles intersect indirectly or directly.

More precisely, draw nn circles each center located at point (aia_i,bib_i) and all their radius are rr, and MJ can reach to any other start from the edge of a circle.

Specially, in order to check the answers you should print the smallest integer that is not less than rr.

Input

The first line contains one integer n(2n500)n(2 \le n \le 500).

In the following nn lines, each line contains two integers ai,bi(109ai,bi109)a_i,b_i(-10^9\leq a_i,b_i \leq 10^9) denoting the center (ai,bia_i,b_i) of a circle.

Output

Print a single integer, denoting the minimum radius r\lceil r \rceil.

3
-3 0
1 0
3 2
2