#pragma GCC optimize(2,3,"Ofast","inline","unroll-loops")
#include<stdio.h>
#include<math.h>
#include<algorithm>
#define M 2005
using namespace std;
int n,X[M],Y[M],lx=2000,rx=0,ly=2000,ry=0;
int Lx[M],Rx[M],Ly[M],Ry[M];
long long ans;
int S(int x1,int y1,int x2,int y2,int x3,int y3){
	x2-=x1,x3-=x1,y2-=y1,y3-=y1;
	return abs(x2*y3-x3*y2);
}
int cal(int x,int y){
	int sm=0;
	for(int i=0;i<n;++i) sm+=S(x,y,X[i],Y[i],X[i+1],Y[i+1]);
	return sm;
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;++i)	
		scanf("%d%d",X+i,Y+i),
		lx=min(lx,X[i]),ly=min(ly,Y[i]),
		rx=max(rx,X[i]),ry=max(ry,Y[i]);
	X[0]=X[n],Y[0]=Y[n];
	int R=cal(X[0],Y[0]);
	for(int y=ly;y<=ry;++y) Lx[y]=rx+1,Rx[y]=lx-1;
	for(int x=lx;x<=rx;++x){
		Ly[x]=ry+1,Ry[x]=ly-1;
		for(int y=ly;y<=ry;++y) if(cal(x,y)==R){Ly[x]=y;break;}
		int l=Ly[x],r=ry,mid;
		while(l<=r){
			mid=l+r>>1;
			if(cal(x,mid)==R) l=mid+1,Ry[x]=mid;
			else r=mid-1;
		}
		for(int y=Ly[x];y<=Ry[x];++y)
			Lx[y]=min(Lx[y],x),
			Rx[y]=max(Rx[y],x);
	}
	for(int x=lx;x<=rx;++x) for(int y=ly;y<=ry;++y){
		for(int k=1;x+k<=rx&&y+k<=ry;++k){
			int l=max({1,Ly[x]-y,Lx[y+k]-x,y+k-Ry[x+k],x+k-Rx[y]});
			int r=min({k,Ry[x]-y,Rx[y+k]-x,y+k-Ly[x+k],x+k-Lx[y]});
			if(l<=r) ans+=r-l+1;
			else break;
		}
	}
	printf("%lld",ans);
}