#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001

int check(long long x0,long long y0,long long x1,long long y1,long long x2,long long y2){
	return (x1-x0) * (y2-y1) - (y1-y0) * (x2-x1);
}

long long get(long long x0,long long y0,long long x1,long long y1,long long x2,long long y2){
	x0 -= x2;
	y0 -= y2;
	x1 -= x2;
	y1 -= y2;
	return abs(x0*y1 - x1*y0);
}

int main(){
	
	int N;
	cin>>N;
	
	vector<long long> x(N),y(N);
	rep(i,N){
		cin>>x[i]>>y[i];
	}
	
	long long ans = 0;
	rep(i,N){
		for(int j=i+1;j<N;j++){
			long long X = 0,Y = 0;
			rep(k,N){
				long long v = check(x[i],y[i],x[k],y[k],x[j],y[j]);
				if(v<0){
					X = max(X,get(x[i],y[i],x[j],y[j],x[k],y[k]));
				}
				if(v>0){
					Y = max(Y,get(x[i],y[i],x[j],y[j],x[k],y[k]));
				}
			}
			ans = max(ans,X+Y);
		}
	}
	cout<<ans<<endl;
	
	return 0;
}