#include<stdio.h>
#include<algorithm>
using namespace std;
char C[101];
const int maxn=302;
int x[maxn],y[maxn];
int ans, n;
int main(void)
{
    int times;
    char fin[100], fout[100];
    for( times = 1 ; times <= 20 ; times++ )
    {
        sprintf(fin,".%d.in", times);
        sprintf(fout,".%d.out", times);
        freopen(fin,"r",stdin);
        freopen(fout,"w",stdout);
        int i,j,k,l,x[305][2]={},xn,t1,t2,ma=0;
	scanf("%d",&xn);
	for(i=0;i<xn;i++)
		scanf("%d %d",&x[i][0],&x[i][1]);
	for(i=0;i<xn;i++)
		for(j=i+1;j<xn;j++)
		{
			for(k=0,t1=t2=-1;k<xn;k++)
			{
				int xt=x[i][0]-x[j][0],yt=x[i][1]-x[j][1],xtt=x[k][0]-x[j][0],ytt=x[k][1]-x[j][1];
				if(xt*ytt-yt*xtt>0&&xt*ytt-yt*xtt>t1)
					t1=xt*ytt-yt*xtt;
				else if(xt*ytt-yt*xtt<0&&xt*ytt-yt*xtt<-t2)
					t2=-(xt*ytt-yt*xtt);
			}
			//printf("%d %d\n",t1,t2);
			if(t1>0&&t2>0&&t1+t2>ma)
				ma=t1+t2;
		}
	printf("%.1lf\n",ma/2.);
    }
}