Circle Containing All Points

You are given $N$ points on a 2D plane. Write a program that finds the diameter of the smallest circle that contains all of the points.

A point that lies on the circumference of the circle counts as contained in the circle.

The first line contains the number of points $N$ ($2 \le N \le 300$).

Each of the next $N$ lines contains the coordinates $x$ and $y$ of one point, separated by a space ($0 \le x, y \le 1\,000$).

Print the minimum diameter of a circle that contains all the points, rounded to two decimal places.