#include<bits/stdc++.h>

using namespace std;
#define f first
#define s second
#define pp pair<int,int>



pp tob(pp x){
	return {-x.f, -x.s};
}
pp toc(pp x){
	return {x.s, -x.f};
}
pp tod(pp x){
	return {-x.s, x.f};
}

#define ll long long

ll area(pp a, pp b, pp c){
	ll k = c.f - a.f, l = c.s - a.s;
	ll m = b.f - a.f, n = b.s - a.s;
	return abs(k*n - l*m);
}

int main(){
	int n;
	cin>>n;

	vector<pair<int,int>> pts;

	set<pair<int,int>> a,b,c,d;

	for(int i=0; i<n; i++){
		int x,y;
		cin>>x>>y;
		a.insert({x,y});
		b.insert({-x,-y});
		c.insert({y,-x});
		d.insert({-y,x});

		pts.emplace_back(x,y);
	}

	pp x1,x2,x3,x4;

	while(a.size()) {
		x1 = *a.begin();
		x2 = *b.begin();
		x2 = {-x2.f,-x2.s};
		x3 = *c.begin();
		x3 = {-x3.s, x3.f};
		x4 = *d.begin();
		x4 = {x4.s, -x4.f};

		//cerr << x1.f << " " << x1.s << endl;
		//cerr << x2.f << " " << x2.s << endl;
		//cerr << x3.f << " " << x3.s << endl;
		//cerr << x4.f << " " << x4.s << endl;
		//cerr << endl;

		a.erase(x1);
		a.erase(x2);
		a.erase(x3);
		a.erase(x4);

		b.erase(tob(x1));
		b.erase(tob(x2));
		b.erase(tob(x3));
		b.erase(tob(x4));

		c.erase(toc(x1));
		c.erase(toc(x2));
		c.erase(toc(x3));
		c.erase(toc(x4));

		d.erase(tod(x1));
		d.erase(tod(x2));
		d.erase(tod(x3));
		d.erase(tod(x4));
	}

	ll val = area(x1,x2,x3);
	
	cout<<val<<endl;
}