#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
template<typename T> bool chmax(T& x, const T& y){return (x<y)?(x=y,true):false;};
template<typename T> bool chmin(T& x, const T& y){return (x>y)?(x=y,true):false;};
constexpr ll MOD=998244353;
constexpr ll INF=2e18;

ll s(ll a, ll b, ll c, ll d, ll e, ll f){
    return abs((a-e)*(d-f)-(c-e)*(b-f));
}

int main(){
    int n; cin >> n;
    VI x(n), y(n);
    REP(i,n) cin >> x[i] >> y[i];
    ll ans=0;
    REP(i,n)REP(j,i){
        ll ax=x[j]-x[i], ay=y[j]-y[i];
        ll ml=0, mr=0;
        REP(k,n){
            if(k==i||k==j)
                continue;
            ll bx=x[k]-x[i], by=y[k]-y[i];
            if(ax*by-ay*bx>0)
                chmax(ml,s(x[i],y[i],x[j],y[j],x[k],y[k]));
            else
                chmax(mr,s(x[i],y[i],x[j],y[j],x[k],y[k]));
        }
        if(ml>0&&mr>0)
            chmax(ans,ml+mr);
    }
    cout << ans << endl;
    return 0;
}