#include<iostream>
#include<cstdio>
#include<set>
#define N 2000
#define inf 1e18
using namespace std;
int read()
{
    char c=0;
    int sum=0,f=1;
    while (c!='-'&&(c<'0'||c>'9')) c=getchar();
    if (c=='-') c=getchar(),f=-1;
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum*f;
}
struct points
{
    int x,y;
};
points st[N+1];
struct reads
{
    int x,y,l,r;
    long long a,b;
    bool operator < (const reads &t)const
    {
	if ((__int128)(a)*t.b!=(__int128)(b)*t.a) return (__int128)(a)*t.b<(__int128)(b)*t.a;
	else if (l!=t.l) return l<t.l;
	else if (r!=t.r) return r<t.r;
	else if (x!=t.x) return x<t.x;
	else return y<t.y;
    }
};
set<reads>s[N+1];
int n,length,rt[N+1],delta[N+1],sz[N+1];
long long dis[N+1][N+1];
int find(int x)
{
    if (rt[x]==x) return x;
    return rt[x]=find(rt[x]);
}
void unionn(int x,int y)
{
    for (int i=1;i<=n;++i)
	if (find(i)==i&&i!=x&&i!=y)
	    dis[y][i]=dis[i][y]=dis[x][i]+dis[y][i];
    delta[y]=++length,sz[y]+=sz[x],rt[x]=y;
    return;
}
void adder(int x,int y,int d)
{
    if (x>y) swap(x,y);
    if (d==1) s[x].insert((reads){x,y,min(delta[x],delta[y]),max(delta[x],delta[y]),dis[x][y],1ll*sz[x]*sz[y]});
    else s[x].erase((reads){x,y,min(delta[x],delta[y]),max(delta[x],delta[y]),dis[x][y],1ll*sz[x]*sz[y]});
    return;
}
int main()
{
    reads top;
    int x,y;
    length=n=read();
    for (int i=1;i<=n;++i) st[i].x=read(),st[i].y=read(),delta[i]=rt[i]=i,sz[i]=1;
    for (int i=1;i<=n;++i)
	for (int j=i+1;j<=n;++j)
	    dis[i][j]=dis[j][i]=(st[i].x-st[j].x)*(st[i].x-st[j].x)+(st[i].y-st[j].y)*(st[i].y-st[j].y),adder(i,j,1);
    for (int i=1;i<=n-1;++i)
    {
	top=(reads){0,0,0,0,(long long)(inf),1};
	for (int j=1;j<=n;++j)
	    if (!s[j].empty()&&(*s[j].begin())<top)
		top=(*s[j].begin());
	x=top.x,y=top.y;
	for (int j=1;j<=n;++j)
	    if (find(j)==j&&j!=x&&j!=y)
		adder(x,j,-1),adder(y,j,-1);
	adder(x,y,-1),unionn(x,y);
	for (int j=1;j<=n;++j)
	    if (find(j)==j&&j!=y)
		adder(y,j,1);
	printf("%d\n",sz[y]);
    }
    return 0;
}