#include<set>

#include<map>

#include<queue>

#include<stack>

#include<cmath>

#include<vector>

#include<string>

#include<cstdio>

#include<cstring>

#include<iomanip>

#include<stdlib.h>

#include<iostream>

#include<algorithm>

using namespace std;

#define eps 1E-8

/*注意可能会有输出-0.000*/

#define sgn(x) (x<-eps? -1 :x<eps? 0:1)//x为两个浮点数差的比较,注意返回整型

#define cvs(x) (x > 0.0 ? x+eps : x-eps)//浮点数转化

#define zero(x) (((x)>0?(x):-(x))<eps)//判断是否等于0

#define mul(a,b) (a<<b)

#define dir(a,b) (a>>b)

typedef long long ll;

typedef unsigned long long ull;

const int Inf=<<;

const ll INF=1LL<<;

const double Pi=acos(-1.0);

const int Mod=1e9+;

const int Max=;

struct Point

{

    double x,y;

    Point(double x=,double y=):x(x),y(y) {};

    inline Point operator-(const Point& a)const

    {

        return Point(x-a.x,y-a.y);

    }

    inline bool operator<(const Point& a)const

    {

        return sgn(x-a.x)<||zero(x-a.x)&&sgn(y-a.y)<;

    }

        inline Point operator+(const Point& a)const

    {

        return Point(x+a.x,y+a.y);

    }

    inline bool operator!=(const Point& a)const

    {

        return !(zero(x-a.x)&&zero(y-a.y));

    }

};

typedef Point Vector;

struct Line

{

    Point p;

    Vector v;

    double ang;//极角

    Line() {};

    Line(Point p,Vector v):p(p),v(v)

    {

        ang=atan2(v.y,v.x);

    }

    inline bool operator<(const Line& L)const

    {

        return ang<L.ang;

    }

};

double Dis(Point A,Point B)

{

    return sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));

}

double Cross(Vector A,Vector B)

{

    return A.x*B.y-A.y*B.x;

}

int ConvexHull(Point *p,int n,Point *convex)//求凸包

{

    sort(p,p+n);

    int m=;

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

    {

        while(m>&&Cross(convex[m-]-convex[m-],p[i]-convex[m-])<)

        {

            m--;

        }

        convex[m++]=p[i];

    }

    int k=m;

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

    {

        while(m>&&Cross(convex[m-]-convex[m-],p[i]-convex[m-])<)

        {

            m--;

        }

        convex[m++]=p[i];

    }

    if(n>)

        m--;

    return m;

}

Point intersection(Point p1,Point p2,Point l1,Point l2)//交点坐标

{

    Point ret=p1;//首先计算直线是否平行

    double t=((p1.x-l1.x)*(l1.y-l2.y)-(p1.y-l1.y)*(l1.x-l2.x))

             /((p1.x-p2.x)*(l1.y-l2.y)-(p1.y-p2.y)*(l1.x-l2.x));

    ret.x+=(p2.x-p1.x)*t;

    ret.y+=(p2.y-p1.y)*t;

    return ret;//线段交点另外判断线段相交(同时判断是否平行)

}

Point now[Max],convex[Max];

double area,per;

double GetArea(Line up,Line down,Line left,Line right)//根据矩形四条线求面积

{

    Point minx=intersection(left.p,left.p+left.v,down.p,down.p+down.v);

    Point miny=intersection(right.p,right.p+right.v,down.p,down.p+down.v);

    Point manx=intersection(left.p,left.p+left.v,up.p,up.p+up.v);

    return Dis(minx,manx)*Dis(minx,miny);

}

double GetPer(Line up,Line down,Line left,Line right)

{

    Point minx=intersection(left.p,left.p+left.v,down.p,down.p+down.v);

    Point miny=intersection(right.p,right.p+right.v,down.p,down.p+down.v);

    Point manx=intersection(left.p,left.p+left.v,up.p,up.p+up.v);

    return (Dis(minx,manx)+Dis(minx,miny))*;

}

Vector Rotate(Vector A,double rad) //向量A逆时针旋转rad

{

return Vector(A.x*cos(rad)-A.y*sin(rad),A.x*sin(rad)+A.y*cos(rad));

}

void RotateStuck(int n)//旋转卡壳枚举矩形

{

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

    {

        convex[i+n]=convex[i];

        convex[i+n+n]=convex[i];

    }

    area=per=Inf;

    Line up,down,left,right;//四条直线

    int i=,j=,k=,l=;//四条线的位置

    for(; i<n; ++i)//枚举上这条线，则可以确定其他

    {

        up=Line(convex[i],convex[i+]-convex[i]);//其他三条直线所在的点与上这条线成单峰函数

        k=max(i,k);//每次是逆时针旋转，保证是凸包上一条线或者后面的线

        while(Cross(Rotate(up.v,Pi/),convex[k+]-convex[k])<)//通过旋转来判断

            k++;

            left=Line(convex[k],Rotate(up.v,Pi/));

        j=max(k,j);

        while(Cross(Rotate(up.v,Pi),convex[j+]-convex[j])<)

            j++;

            down=Line(convex[j],Rotate(up.v,Pi));

        l=max(j,l);

        while(Cross(Rotate(up.v,*Pi/),convex[l+]-convex[l])<)

            l++;

            right=Line(convex[l],Rotate(up.v,*Pi/));

        area=min(area,GetArea(up,down,left,right));

        per=min(per,GetPer(up,down,left,right));

    }

    return ;

}

int main()

{

    int n;

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

    {

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

        {

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

        }

        int m= ConvexHull(now,n,convex);

        RotateStuck(m);

        printf("%.2f %.2f\n",area,per);

    }

    return ;

}