#include<bits/stdc++.h>
#define rep(i,x,y) for(int i=x; i<=y; ++i)
#define pb push_back

using namespace std;
const int N=4005;
typedef long long LL;
bool vis[N];
int n,s[N];
LL dis[N][N];
vector <int> vt;

int getint()
{
	char ch;
	int f=1;
	while(!isdigit(ch=getchar())) if(ch=='-') f=-1;
	int x=ch-48;
	while(isdigit(ch=getchar())) x=x*10+ch-48;
	return x*f;
}

struct point {int x,y;} dat[N];
struct D
{
	LL d;
	int x,y;

	bool operator < (const D &t) const
	{
		LL a=(LL)s[x]*s[y];
		LL b=(LL)s[t.x]*s[t.y];
		if(d*b==t.d*a) return x==t.x?y>t.y:x>t.x;
		return d*b>t.d*a;
	}
} ;

priority_queue <D> q;

LL sqr(LL x) {return x*x;}
LL len(point a,point b) {return sqr(a.x-b.x)+sqr(a.y-b.y);}

void del(int x)
{
	vis[x]=1;
	int sz=vt.size();
	rep(i,0,sz-1) if(vt[i]==x)
	{
		rep(j,i+1,sz-1) vt[j-1]=vt[j];
		break;
	}
	vt.pop_back();
}

LL d(int x,int y)
{
	if(x>y) swap(x,y);
	return dis[x][y];
}

int main()
{
	n=getint();
	rep(i,1,n) dat[i].x=getint(),dat[i].y=getint();
	rep(i,1,n) s[i]=1,vt.pb(i);
	rep(i,1,n) rep(j,i+1,n) q.push((D){dis[i][j]=len(dat[i],dat[j]),i,j});
	int m=n-1;
	while(m)
	{
		D t=q.top(); q.pop();
		if(vis[t.x] || vis[t.y]) continue;
		del(t.x),del(t.y);
		s[++n]=s[t.x]+s[t.y];
		for(auto j:vt)
			q.push((D){dis[j][n]=d(j,t.x)+d(j,t.y),j,n});
		vt.push_back(n),--m;
		printf("%d\n",s[n]);
	}
	return 0;
}