// g++ 1.cpp -std=c++17 -O2 -I .
#include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
using namespace atcoder;

using ll = long long;
using ld = long double;
 
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vst = vector<string>;
using vvst = vector<vst>;
 
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pq_big(T) priority_queue<T,vector<T>,less<T>>
#define pq_small(T) priority_queue<T,vector<T>,greater<T>>
#define all(a) a.begin(),a.end()
#define rep(i,start,end) for(ll i=start;i<(ll)(end);i++)
#define per(i,start,end) for(ll i=start;i>=(ll)(end);i--)
#define uniq(a) sort(all(a));a.erase(unique(all(a)),a.end())

struct point{
  ll x,y;
};

// 面積の 2 倍
ll area(point a,point b,point c){
  return abs((a.x-c.x)*(b.y-c.y)-(b.x-c.x)*(a.y-c.y));
}

// c は ab より上か?
bool up(point a,point b,point c){
  ll s=(a.x-b.x)*(c.y-a.y)-(a.y-b.y)*(c.x-a.x);
  if(s>0){
    return 1;
  }
  return 0;
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int n;cin>>n;
  vector<point> v(n);
  ll ans=0;

  rep(i,0,n){
    int x,y;cin>>x>>y;
    v[i]={x,y};
  }

  rep(i,0,n){
    rep(j,i+1,n){
      ll a1=-1e18,a2=-1e18;
      rep(k,0,n){
        if(k==i||k==j)continue;
        ll a=area(v[i],v[j],v[k]);
        if(up(v[i],v[j],v[k])==1){
          a1=max(a1,a);
        }
        else{
          a2=max(a2,a);
        }
      }

      ans=max(ans,a1+a2);
    }
  }

  cout<<ans<<endl;
}