#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}

bool det(pair<ll,ll> a,pair<ll,ll> b,pair<ll,ll> c){
	a.first-=b.first;
	a.second-=b.second;
	b.first-=c.first;
	b.second-=c.second;
	return (0<a.first*b.second-a.second*b.first);
}

bool _2d_comp(pair<ll,ll> &l,pair<ll,ll> &r){
	if(l.first==0&&r.first==0) return l.second>r.second;
	if(l.first==0){
		return l.second>0||r.first<0;
	}
	if(r.first==0){
		return !(r.second>0||l.first<0);
	}
	if((l.first<0)^(r.first<0)) return l.first>0;
	return l.first*r.second<l.second*r.first;
}


void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int N;
	cin>>N;
	vector<pair<ll,ll>> p(N);
	rep(i,N) cin>>p[i].first>>p[i].second;
	vector<ll> X(N),Y(N);
	So(p);
	rep(i,N) tie(X[i],Y[i])=p[i];
	vector<int> conv(N);
	int k=0;
	rep(i,N){
		while(k>1&&det(p[conv[k-2]],p[conv[k-1]],p[i])){
			k--;
		}
		conv[k]=i;
		k++;
	}
	int t=k;
	for(int i=N-2;i>=0;i--){
		while(k>t&&det(p[conv[k-2]],p[conv[k-1]],p[conv[i]])){
			k--;
		}
		conv[k]=i;
		k++;
	}
	conv.resize(k);
	int x=0;
	vector<int> order(N+k);
	rep(i,N+k) order[i]=i;
	auto sub_p=[](pair<ll,ll> a,pair<ll,ll> b)->pair<ll,ll>{
		return {a.first-b.first,a.second-b.second};
	};
	sort(all(order),[&](int l,int r){
		pair<ll,ll> L,R;
		if(l<N) L=p[l];
		else L=sub_p(p[conv[l-N]],p[conv[(l-N+k-1)%k]]);
		if(r<N) R=p[r];
		else R=sub_p(p[conv[r-N]],p[conv[(r-N+k-1)%k]]);
		return _2d_comp(L,R);
	});
	ll ans=0;
	rep(i,N*2+k*2){
		int v=order[i%(N+k)];
		if(v<N){
			pair<ll,ll> A=p[v],B=p[conv[x]];
			chmax(ans,abs(A.first*B.second-A.second*B.first));
		}else{
			x=v-N;
		}
	}
	cout<<ans<<"\n";
}