#include <iostream>
#include <algorithm>
#include <cstdio>
#include <iomanip>
#include <cstring>
using namespace std;
struct node
{
	int x,y;
}a[400];
int n,ans=0;
int main()
{
	freopen("trib.in","r",stdin);
	freopen("trib.out","w",stdout);
	cin>>n;
	for (int i=1;i<=n;i++)
		scanf("%d%d",&a[i].x,&a[i].y);
	for (int i=1;i<=n;i++)
		for (int j=i+1;j<=n;j++)
			for (int k=j+1;k<=n;k++)
			{
				int l,r,u,d,sum=0;
				double p;
				l=min(a[i].x,a[j].x);
				r=max(a[i].x,a[j].x);
				u=max(a[i].y,a[j].y);
				d=min(a[i].y,a[j].y);
				p=1.0*(u-d+1)/(r-l+1);
				if (p>1) sum+=(1+r-l)*(u-d)/2;
				else sum+=(u-d+1)*(r-l)/2;
				l=min(a[i].x,a[k].x);
				r=max(a[i].x,a[k].x);
				u=max(a[i].y,a[k].y);
				d=min(a[i].y,a[k].y);
				p=1.0*(u-d+1)/(r-l+1);
				if (p>1) sum+=(1+r-l)*(u-d)/2;
				else sum+=(u-d+1)*(r-l)/2;
				l=min(a[j].x,a[k].x);
				r=max(a[j].x,a[k].x);
				u=max(a[j].y,a[k].y);
				d=min(a[j].y,a[k].y);
				p=1.0*(u-d+1)/(r-l+1);
				if (p>1) sum+=(1+r-l)*(u-d)/2;
				else sum+=(u-d+1)*(r-l)/2;
				l=min(a[j].x,min(a[k].x,a[i].x));
				r=max(a[j].x,max(a[k].x,a[i].x));
				u=max(a[j].y,max(a[i].y,a[k].y));
				d=min(a[j].y,min(a[k].y,a[i].y));
				if ((l-r+1)*(u-d+1)-sum>ans) ans=(l-r+1)*(u-d+1)-sum;
			}
	cout<<ans<<endl;
	fclose(stdin);
	fclose(stdout);
	return 0;
}