/*
TASK:atom
LANG:C
*/
#include<stdio.h>
#include<math.h>
#define MAXN 110

#define DIST(x1,y1,x2,y2) ( ((x1)-(x2))*((x1)-(x2)) +((y1)-(y2))*((y1)-(y2)) )


int N;
double x[MAXN],y[MAXN];



void input();
void solve();


int main()
{
input();

solve();
return 0;
}



void solve()
{
int i,j,k;
double xx, yy;
double dist;
double max, min;
double bestx, besty;


max = 0;

for(i=1; i<=N; i++)
 for(j=i+1; j<=N; j++)
  {
  xx = (x[i] + x[j])/2;
  yy = (y[i] + y[j])/2;
  min = 10000000000;
  
  for(k=1; k<=N; k++)
   {
   dist = DIST(x[k],y[k],xx,yy);
   if(dist < min) min = dist;
   }
  if(min > max) { max = min; bestx = xx; besty = yy; }
  }

printf("%.2lf\n",sqrt(max));
printf("%.2lf %.2lf\n",bestx, besty);
}


void input()
{
int i;

scanf("%d",&N);
for(i=1; i<=N; i++)
 scanf("%lf%lf",&x[i],&y[i]);
}

