#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a >= b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int main(){
    ll n;cin >> n;
    vl x(n),y(n);
    rep(i,n)cin >> x[i] >> y[i];
    ll ans=0;
    rep(i,n){
        rep(j,i){
            vl left,right;
            rep(k,n){
                if(k==i||k==j)continue;
                ll vx1=x[j]-x[i];
                ll vy1=y[j]-y[i];
                ll vx2=x[k]-x[i];
                ll vy2=y[k]-y[i];
                ll ans=vx1*vy2-vy1*vx2;
                if(ans<0)left.emplace_back(abs(ans));
                else right.emplace_back(abs(ans));
            }
            ll p=-INF,q=-INF;
            for(auto z:left)chmax(p,z);
            for(auto z:right)chmax(q,z);
            chmax(ans,p+q);
        }
    }
    cout << ans << endl;
}