C prog to find circle which covers set of pts. & has minimal area.Thr vl be no more than 100 pts. in 1 problm?

INPUT:


input contains several problems.The first line of each problem is a line containing only 1 integer N which indicates the number of points to be covered.The next N lines contains N points.Each points is represented by x %26amp; y coordinates by a comma.After the last problem, there will be a line contains only a zero.





OUTPUT should be:


for each input problem, you should give a one-line answer which contains 3 numbers separated by commas.The first 2 numbers indicate the x %26amp; y coordinates of the result circle, %26amp; the third number is the radius of the circle.





SAMPLE INPUT:


2


0.0 , 0.0


3,0


5


0,0


0,1


1,0


1,1


2,2


0





OUTPUT FOR THE SAMPLE INPUT:





1.5 , 0 , 1.5


1 , 1, 1.414

C prog to find circle which covers set of pts. %26amp; has minimal area.Thr vl be no more than 100 pts. in 1 problm?
sorry i dont know.





If u know some analytical geometry, help me programming this circle.