#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define endl '\n'
#define X first
#define Y second

using namespace std;

void fileIO()
{
    freopen("triangle.in", "r", stdin);
    freopen("triangle.out", "w", stdout);
}
void fastIO()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

const double PI=acos(-1);

const int MAXN=1505;

int n;
pair<int,int> p[MAXN];
pair<int,int> q[MAXN];
pair<int,int> centr;

int dist(pair<int,int> a,pair<int,int> b)
{
    int dx=a.X-b.X;
    int dy=a.Y-b.Y;
    return dx*dx+dy*dy;
}
int det(pair<int,int> c,pair<int,int> a,pair<int,int> b)
{
    return (a.X-c.X)*(b.Y-c.Y)-(a.Y-c.Y)*(b.X-c.X);
}
int adet(pair<int,int> c,pair<int,int> a,pair<int,int> b)
{
    int ret=det(c,a,b);
    if(ret<0) return -ret;
    return ret;
}
bool cmpdet(pair<int,int> a,pair<int,int> b)
{
    int d=det(p[1],a,b);
    if(!d) return dist(a,p[1])<dist(b,p[1]);
    return d>0;
}

double getAngle(pair<int,int> a)
{
    a.X-=centr.X;
    a.Y-=centr.Y;
    if(a.X==0 && a.Y==0) return 0;
    double ret=atan2(a.Y, a.X);
    if(ret<0) ret+=2*PI;
    return ret;
}

bool cmp(pair<int,int> a,pair<int,int> b)
{
    int ang1=getAngle(a);
    int ang2=getAngle(b);
    if(ang1<ang2) return 1;
    if(ang1>ang2) return 0;
    return dist(centr,a)<dist(centr,b);
}

void solve()
{
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>p[i].X>>p[i].Y;
        q[i]=p[i];
    }

    int ind=1;
    for(int i=1; i<=n; i++)
    {
        if(p[i].X<p[ind].X) ind=i;
        else if(p[i].X==p[ind].X && p[i].Y<p[ind].Y) ind=i;
    }
    swap(p[ind],p[1]);
    sort(p+2,p+n+1,cmpdet);
    int ptr=2;
    for(int i=3; i<=n; i++)
    {
        while(det(p[ptr-1],p[ptr],p[i])<0) ptr--;
        p[++ptr]=p[i];
    }

    int maxS=0;
    for(int i=1;i<=ptr-2;i++)
    {
        int j=i+1, k=i+2;
        int curs=adet(p[i], p[j], p[k]);
        while(j<=ptr-1)
        {
            while(k<ptr && curs<=adet(p[i],p[j],p[k+1]))
            {
                k++;
                curs=adet(p[i],p[j],p[k]);
            }
            if(curs<=adet(p[i],p[j+1],p[k]))
            {
                j++;
                curs=adet(p[i],p[j],p[k]);
            }
            else break;
        }
        maxS=max(maxS,curs);
    }

    int minS=1e9;
    for(int i=1;i<=n;i++)
    {
        centr=q[i];
        sort(q+1,q+n+1,cmp);
        for(int j=2;j<n;j++)
        {
            int S=adet(centr,q[j],q[j+1]);
            minS=min(minS, S);
        }
    }

    cout<<fixed<<setprecision(5)<<(double)minS/2<<" "<<(double)maxS/2<<endl;
    return;
}

int main()
{
    fastIO();
    fileIO();

    int tt;
    cin>>tt;
    while(tt--)
    {
        solve();
    }

    return 0;
}