#include<stdio.h>

 #include<math.h>

 #include<algorithm>

 #define M 50005

 #include<iostream>

 #define inf 200005

 #define eps 1e-8

 using namespace std;

 struct node

 {

     double x,y;

 }p[M];

 int n,cnt;

 double dis(node a,double b)

 {

     return sqrt((a.x-b)*(a.x-b)+a.y*a.y);

 }

 double cal(double a)

 {

     double ans=;

     for(int i=;i<n;i++){

         double t=dis(p[i],a);

         if(ans<t) ans=t;

     }

     return ans;

 }

 int main()

 {

     double l,r,m,mm;

     while(scanf("%d",&n)&&n){

         l=inf;r=-inf;

         for(int i=;i<n;i++){

             scanf("%lf %lf",&p[i].x,&p[i].y);

             if(p[i].x<l) l=p[i].x;

             if(p[i].x>r) r=p[i].x;

         }

         while(r-l>=eps){

             m=(l+r)/;

             mm=(l+m)/;

             double t=cal(m);

             double tt=cal(mm);

             if(t>=tt) r=m;

             else l=mm;

         }

         printf("%.9lf %.9lf\n",r,cal(r));

     }

     return ;

 }