Big Circle

At a World Cup opening ceremony, children from around the world tried to form a big circle on the field. They succeeded in making a perfect circle, but because they had not practiced much, the kids were not evenly spaced. Find the minimum Euclidean distance between any two kids.

The first line contains an integer $N$, the number of kids. Each of the next $N$ lines contains two real numbers, rounded to two decimal places, giving the coordinates of one kid.

It is guaranteed that all points lie on one circle.

Print one real number, rounded to two decimal places: the minimum Euclidean distance between two kids.

• $2 \le N \le 10^5$
• Every coordinate lies in $[-10^6, 10^6]$.