#include<bits/stdc++.h>

using namespace std;

//input by bxd

#define rep(i,a,b) for(int i=(a);i<=(b);i++)

#define repp(i,a,b) for(int i=(a);i>=(b);i--)

#define RI(n) scanf("%d",&(n))

#define RII(n,m) scanf("%d%d",&n,&m)

#define RIII(n,m,k) scanf("%d%d%d",&n,&m,&k)

#define RS(s) scanf("%s",s);

#define LL long long

#define pb push_back

#define fi first

#define REP(i,N)  for(int i=0;i<(N);i++)

#define CLR(A,v)  memset(A,v,sizeof A)

///////////////////////////////////

#define inf 0x3f3f3f3f

#define N 50010

int n;

struct node{

    long long x,y;

}p[N],temp[N];

bool cmp(node a,node b) {

    return b.y*a.x>a.y*b.x;

}

int main() {

    scanf("%d",&n);

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

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

    }

    double ans=pow(,)/;

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

        int t=;

        for(int j=;j<=n;j++) {

            if(i==j) continue;

            temp[t].x=p[j].x-p[i].x;

            temp[t].y=p[j].y-p[i].y;

            t++;

        }

        sort(temp+,temp+t,cmp);

        for(int j=;j<t-;j++){

        ans=min(ans,(temp[j].x*temp[j+].y-temp[j+].x*temp[j].y)*0.5);

        }

    }

    printf("%.3f",ans);

    return ;

}