#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read(){
	int x=0,f=1;
	char ch=getchar();
	for(;!isdigit(ch);ch=getchar())if(ch=='-')f=-f;
	for(;isdigit(ch);ch=getchar())x=(x<<1)+(x<<3)+(ch^48);
	return x*f;
}
const int N=1e5+5,inf=0x3f3f3f3f3f3f3f3f;
int n,x[N],y[N],f[N],g[N];
signed main(){
	n=read();
	for(int i=1;i<=n;i++){
		x[i]=read(),y[i]=read();
	}
	memset(f,-0x3f,sizeof f);
	memset(g,0x3f,sizeof g);
	x[n+1]=x[1],y[n+1]=y[1];
	for(int i=1;i<=n;i++){
		int a=x[i]-x[i+1],b=y[i+1]-y[i],c=x[i]*b+y[i]*a;
		for(int j=0;j<=2e3;j++){
			if(x[i]>x[i+1])f[j]=max(f[j],(c-b*j+a-1)/a);
			if(x[i]<x[i+1])g[j]=min(g[j],(c-b*j)/a);
			if(x[i]==x[i+1]&&c-b*j>0)f[j]=inf,g[j]=-inf;
		}
	}
	for(int i=0;i<=2e3;i++){
		if(f[i]>g[i])f[i]=inf,g[i]=-inf;
	}
	int ans=0;
	for(int i=0;i<=2e3;i++){
		printf("%lld\n",i);
		for(int j=1;i+j<=2e3;j++){
			for(int k=0;i+j+k<=2e3;k++){
				int L=max({f[k]-i,f[k+i]-i-j,f[k+j],f[k+i+j]-j});
				int R=min({g[k]-i,g[k+i]-i-j,g[k+j],g[k+i+j]-j});
				if(L>R)continue;
				ans+=R-L+1;
			}
		}
	}
	printf("%lld\n",ans);
	return 0;
}