Their are N unique points on 2-D plane, find a minimum circle that can enclose all the points.

 

multiple cases ended with EOF.

for each case:

first line: N (1 < N < 10)

next N lines each contains two integers indicating the coordinate of the ith point: xi, yi (-1000 < xi,yi < 1000)

 

for each case, output one line containing the radius of the minimum circle you find, rounded to two digit after the dot.

2
0 0
2 0
3
0 0
2 0
0 2

1.00
1.41

Brute-Force algorithm is recommended.