nclude <iostream>
#include <math.h>
#include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
#define eps 1e-10
#define maxn 310
typedef struct point{
double x,y;
}p;
p Point[maxn];
double cross(point p1,point p2,point p0){
return ((p1.x-p0.x)*(p2.y-p0.y)-(p1.y-p0.y)*(p2.x-p0.x))*0.5;
}
double max(double a,double b){
if(a>b) return a;
return b;
}
int main()
{
int n;
while(~scanf("%d",&n)){
for(int i=0;i<n;i++)
scanf("%lf %lf",&Point[i].x,&Point[i].y);
double ans=0,lmax=0,rmax;
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
rmax=0,lmax=0;
for(int k=0;k<n;k++){
if(k!=i && k!=j){
double s=cross(Point[i],Point[j],Point[k]);
if(s<eps){
lmax=max(lmax,-s);
}
else{
rmax=max(rmax,s);
}
}
}
if(lmax==0 || rmax==0)continue;
ans=max(ans,(rmax+lmax));
}
}
printf("%lf\n",ans);
}
