Road Construction
题号:NC52310
时间限制:C/C++/Rust/Pascal 3秒,其他语言6秒
空间限制:C/C++/Rust/Pascal 512 M,其他语言1024 M
Special Judge, 64bit IO Format: %lld

题目描述

The mayor of Byteland is planning to build a new road across the town. Constructing new roads may facilitate transportation and stimulate economic development; the negative aspects include, the noise that may affect the residents nearby, and the nonnegligible impacts on the local ecological environment.

You have been required to draft a road construction plan. In your plan, you can model the residents of the town as points, and the road as a straight line of infinite length. Your plan should satisfy the following conditions:
- The road should not pass through any resident of the city;
- The numbers of residents on both sides of the road are equal;
- The minimum of the distances of the residents to the road is maximized.
The following figure depicts the optimal road construction plan for the first sample test data.

Since there are too many residents in Byteland, you believe it is impossible to find such a construction plan manually. It's your time to write a program and find the optimal plan.

输入描述:

The input starts with a line containing an even integer n  indicating the number of residents in Byteland. It is then followed by n lines, each containing two integers x, y , the Cartesian coordinates of a resident. No two residents share the same coordinates.

输出描述:

Print the minimum of the distances of the residents to the road you plan to build. Your answer should have an absolute or relative error of no more than .
示例1

输入

复制
6
0 0
3 0
1 2
4 3
-1 4
5 -3

输出

复制
1.264911064067
示例2

输入

复制
2
1 3
2 5

输出

复制
1.118033988750