#pragma GCC optimize(2)

 #pragma G++ optimize(2)

 #include<cstring>

 #include<cmath>

 #include<iostream>

 #include<algorithm>

 #include<cstdio>

 #define eps 0.00000001

 #define N 50007

 using namespace std;

 inline int read()

 {

     int x=,f=;char ch=getchar();

     while(!isdigit(ch)){if(ch=='-')f=-;ch=getchar();}

     while(isdigit(ch)){x=(x<<)+(x<<)+ch-'';ch=getchar();}

     return x*f;

 }

 int n,tot;

 double ans=1e60;

 struct P

 {

     double x,y;

     P(){}

     P(double _x,double _y):x(_x),y(_y){}

     friend bool operator<(P a,P b){return fabs(a.y-b.y)<eps?a.x<b.x:a.y<b.y;}

     friend bool operator==(P a,P b){return fabs(a.x-b.x)<eps&&fabs(a.y-b.y)<eps;}

     friend bool operator!=(P a,P b){return !(a==b);}

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

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

     friend double operator*(P a,P b){return a.x*b.y-a.y*b.x;}

     friend P operator*(P a,double b){return P(a.x*b,a.y*b);}

     friend double operator/(P a,P b){return a.x*b.x+a.y*b.y;}

     friend double dis(P a){return sqrt(a.x*a.x+a.y*a.y);}

 }p[N],q[N],t[];

 bool cmp(P a,P b)

 {

     double t=(a-p[])*(b-p[]);

     if(fabs(t)<eps)return dis(p[]-a)-dis(p[]-b)<;

     return t>;

 }

 void Graham()

 {

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

         if(p[i]<p[])swap(p[i],p[]);

     sort(p+,p+n+,cmp);

     q[++tot]=p[];

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

     {

         while(tot>&&(q[tot]-q[tot-])*(p[i]-q[tot])<eps)tot--;

         q[++tot]=p[i];

     }

     q[]=q[tot];//凸包是一个回路。

 }

 void RC()

 {

     int l=,r=,p=;

     double L,R,D,H;

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

     {

         D=dis(q[i]-q[i+]);

         while((q[i+]-q[i])*(q[p+]-q[i])-(q[i+]-q[i])*(q[p]-q[i])>-eps)p=(p+)%tot;

         while((q[i+]-q[i])/(q[r+]-q[i])-(q[i+]-q[i])/(q[r]-q[i])>-eps)r=(r+)%tot;

         if(i==)l=r;

         while((q[i+]-q[i])/(q[l+]-q[i])-(q[i+]-q[i])/(q[l]-q[i])<eps)l=(l+)%tot;

         L=(q[i+]-q[i])/(q[l]-q[i])/D,R=(q[i+]-q[i])/(q[r]-q[i])/D;

         H=(q[i+]-q[i])*(q[p]-q[i])/D;

         if(H<)H=-H;

         double tmp=(R-L)*H;

         if(tmp<ans)

         {

             ans=tmp;

             t[]=q[i]+(q[i+]-q[i])*(R/D);

             t[]=t[]+(q[r]-t[])*(H/dis(t[]-q[r]));

             t[]=t[]-(t[]-q[i])*((R-L)/dis(q[i]-t[]));

             t[]=t[]-(t[]-t[]);

         }

     }

 }

 int main()

 {

     n=read();

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

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

     Graham();

     RC();

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

     int fir=;

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

         if(t[i]<t[fir])fir=i;

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

         printf("%.5lf %.5lf\n",t[(i+fir)%].x,t[(i+fir)%].y);

 }