#include<cstdio>

#include<cstring>

#include<algorithm>

#include<cmath>

using namespace std;

typedef double db;

db const eps=1e-;

int const xn=;

int n;

db ans;

int dmp(db x){if(fabs(x)<=eps)return ; return x>eps?:-;}

struct P{

  db x,y;

  P(db x=,db y=):x(x),y(y) {}

  bool operator < (const P &b) const

  {return dmp(x-b.x)<||dmp(x-b.x)==&&dmp(y-b.y)<;}

  P operator + (const P &b) const

  {return P(x+b.x,y+b.y);}

  P operator - (const P &b) const

  {return P(x-b.x,y-b.y);}

  P operator * (const db &v) const

  {return P(x*v,y*v);}

  P operator / (const db &v) const

  {return P(x/v,y/v);}

}p[xn],c[xn],pos[];

db cross(P a,P b){return a.x*b.y-a.y*b.x;}

db dot(P a,P b){return a.x*b.x+a.y*b.y;}

void find()

{

  sort(p+,p+n+); int top=;

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

    {

      while(top>&&dmp(cross(c[top]-c[top-],p[i]-c[top]))<=)top--;

      c[++top]=p[i];

    }

  int num=top;

  for(int i=n-;i;i--)

    {

      while(top>num&&dmp(cross(c[top]-c[top-],p[i]-c[top]))<=)top--;

      c[++top]=p[i];

    }

  n=top-;

}

int upt(int x){if(x>n)x-=n; if(x<)x+=n; return x;}

db sqr(db x){return x*x;}

db dis(P a,P b){return sqrt(sqr(a.x-b.x)+sqr(a.y-b.y));}

bool cmp(P a,P b){return dmp(a.y-b.y)<||(dmp(a.y-b.y)==&&dmp(a.x-b.x)<);}

void rc()

{

  ans=-;

  //int p=2,l=1,r=2;//

  int p=,l=,r=; c[n+]=c[];

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

    {

      db d=dis(c[i],c[i+]);

      while(dmp(cross(c[i]-c[p],c[i+]-c[p])-cross(c[i]-c[p+],c[i+]-c[p+]))<=)p=upt(p+);

      while(dmp(dot(c[r]-c[i],c[i+]-c[i])-dot(c[r+]-c[i],c[i+]-c[i]))<=)r=upt(r+);

      if(i==)l=r;//

      while(dmp(dot(c[l]-c[i],c[i+]-c[i])-dot(c[l+]-c[i],c[i+]-c[i]))>=)l=upt(l+);

      db L=dot(c[i+]-c[i],c[l]-c[i])/d;

      db R=dot(c[i+]-c[i],c[r]-c[i])/d;

      db H=cross(c[i]-c[p],c[i+]-c[p])/d;

      db tmp=(R-L)*H;

      if(ans<||dmp(ans-tmp)>)

    {

      ans=tmp;

      pos[]=c[i]+(c[i+]-c[i])*(R/d);

      pos[]=pos[]+(c[r]-pos[])*(H/dis(c[r],pos[]));

      //pos[2]=pos[1]+(c[p]-pos[1])*((R-L)/dis(c[p],pos[1]));//也可

      pos[]=pos[]+(c[i]-pos[])*((R-L)/dis(c[i],pos[]));

      pos[]=pos[]+(pos[]-pos[]);

    }

    }

}

int main()

{

  scanf("%d",&n);

  for(int i=;i<=n;i++)scanf("%lf%lf",&p[i].x,&p[i].y);

  find();

  rc();

  printf("%.5f\n",ans);

  int st=;

  for(int i=;i<;i++)if(cmp(pos[i],pos[st]))st=i;

  for(int i=st,cnt=;cnt<=;i=(i+)%,cnt++)

    {

      if(fabs(pos[i].x)<=eps)pos[i].x=;

      if(fabs(pos[i].y)<=eps)pos[i].y=;

      printf("%.5f %.5f\n",pos[i].x,pos[i].y);

    }

  return ;

}