#include<bits/stdc++.h>
using namespace std;
#define int long long
#define MAXN 5005
int n;
struct Node
{
	int cx,cy;
	int cx2,cy2;
	int siz;
}node[MAXN];
int cal(int a,int b)
{
	int xx=node[a].cx2*node[b].siz+node[b].cx2*node[a].siz-2*node[a].cx*node[b].cx;
	int yy=node[a].cy2*node[b].siz+node[b].cy2*node[a].siz-2*node[a].cy*node[b].cy;
	return xx+yy;
}
struct Par
{
	int aid,bid;
	int dist;
	int siz;
};
bool operator <(const Par &a,const Par &b)
{
	if(a.dist*b.siz!=b.dist*a.siz)
	{
		return a.dist*b.siz>b.dist*a.siz;
	}
	if(a.aid!=b.aid)
	{
		return a.aid>b.aid;
	}
	return a.bid>b.bid;
}
priority_queue<Par>pq;
int fa[MAXN];
int find(int x)
{
	if(x==fa[x])
	{
		return x;
	}
	return fa[x]=find(fa[x]);
}
int cnt;
void mer(Par now)
{
	cnt++;
	int x=now.aid,y=now.bid;
	fa[x]=cnt;fa[y]=cnt;fa[cnt]=cnt;
	node[cnt].siz=node[x].siz+node[y].siz;
	node[cnt].cx=node[x].cx+node[y].cx;
	node[cnt].cx2=node[x].cx2+node[y].cx2;
	node[cnt].cy=node[x].cy+node[y].cy;
	node[cnt].cy2=node[x].cy2+node[y].cy2;
}
signed main()
{
	scanf("%d",&n);
	int i;
	for(i=1;i<=n;i++)
	{
		int x,y;
		scanf("%lld%lld",&x,&y);
		fa[i]=i;
		node[i].cx=x;node[i].cy=y;
		node[i].cx2=x*x;node[i].cy2=y*y;
		node[i].siz=1;
	}
	int j;
	for(i=1;i<=n;i++)
	{
		for(j=i+1;j<=n;j++)
		{
			Par p;
			p.aid=i;p.bid=j;
			p.dist=cal(i,j);
			p.siz=1;
			pq.push(p);
		}
	}
	cnt=n;
	while(!pq.empty())
	{
		Par now=pq.top();pq.pop();
		if(find(now.aid)!=now.aid||find(now.bid)!=now.bid)
		{
			continue;
		}
		mer(now);
		printf("%lld\n",node[cnt].siz);
		for(i=1;i<cnt;i++)
		{
			if(find(i)==i)
			{
				Par p;
				p.aid=i;p.bid=cnt;
				p.dist=cal(i,cnt);
				p.siz=node[i].siz*node[cnt].siz;
				pq.push(p);
			}
		}
	}
	return 0;
}