#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read()
{
	int sum=0,f=1;
	char ch=getchar();
	while(!isdigit(ch)){if(ch=='-')f*=-1;ch=getchar();}
	while(isdigit(ch)){sum=sum*10+ch-48;ch=getchar();}
	return sum*f;
}
int ord[2005][2005];
struct node{
	int x,y;
};
node P[2005];
int fa[5005];
int pfhx[5005],pfhy[5005];
int sumx[5005],sumy[5005];
int gs[5005];
int tot;
const double eps = 1e-7;
priority_queue<pair<double,pair<int,int> > > pq;
inline int find_father(int x)
{
	if(fa[x]!=x) return fa[x]=find_father(fa[x]);
	return x;
}
inline void unionn(int x,int y)
{
	int rx=find_father(x);
	int ry=find_father(y);
	if(rx==ry) return;
	cout<<gs[rx]+gs[ry]<<endl;
	tot++;
	fa[rx]=tot,fa[ry]=tot;
	pfhx[tot]=pfhx[rx]+pfhx[ry];
	pfhy[tot]=pfhy[rx]+pfhy[ry];
	sumx[tot]=sumx[rx]+sumx[ry];
	sumy[tot]=sumy[rx]+sumy[ry];
	gs[tot]=gs[rx]+gs[ry];
}
inline double dis(int x,int y)
{
	x=find_father(x),y=find_father(y);
	double dx = pfhx[x]*gs[y]+pfhx[y]*gs[x]-sumx[x]*sumx[y]*2;
	double dy = pfhy[x]*gs[y]+pfhy[y]*gs[x]-sumy[x]*sumy[y]*2;
	return (dx+dy) / (double)(gs[x]*gs[y]);
}
inline bool check_top()
{
	double g=-pq.top().first;
	int nx=-pq.top().second.first;
	int ny=-pq.top().second.second;
	pq.pop();
//	cout<<nx<<" "<<ny<<" "<<g<<endl;
//	system("pause");
	if(find_father(nx)==find_father(ny)) return 0;
	double d=dis(nx,ny);
//	cout<<nx<<" "<<ny<<" "<<g<<" "<<d<<endl;
//	system("pause");
	if(d <= g+eps && d >= g-eps)
	{
		unionn(nx,ny);
		return 1;
	}
	
	nx=find_father(nx);
	ny=find_father(ny);
	pq.push(make_pair( -d,make_pair(-min(nx,ny) , -max(nx,ny)) ));
	
	return 0;
}
signed main()
{
	int n;
	n=read();
	for(int i=1;i<=n;i++)P[i].x=read(),P[i].y=read();
	for(int i=1;i<=n;i++) fa[i]=i,sumx[i]=P[i].x,sumy[i]=P[i].y,pfhx[i]=P[i].x*P[i].x,pfhy[i]=P[i].y*P[i].y,gs[i]=1;
	for(int i=n+1;i<=2*n;i++) fa[i]=i;
	tot=n;
	for(int i=1;i<=n;i++)
		for(int j=i+1;j<=n;j++)
		{
			double d=dis(i,j);
			pq.push(make_pair(-d,make_pair(-i,-j)));
		}
	
	int T=n-1;
	while(T--)
		while(!check_top());
	
	return 0;
}