#include<bits/stdc++.h>
using namespace std;
#define For(i,a,b) for(int i=(a);i<=(b);i++)
#define Rof(i,a,b) for(int i=(a);i>=(b);i--)
#define clr(a) memset(a,0,sizeof(a))
typedef long long ll;
typedef double db;
const int N=4005;
const ll INFll=32e12;
int n,p[N];
int sx[N],sx2[N],sy[N],sy2[N],siz[N];
bool used[N];
struct node{int x,y; int s; ll v;}a[N][N];
node make_node(int x,int y)
{
    node a;
    if(x>y)swap(x,y);
    a.x=x; a.y=y;
    a.v=1ll*sx2[x]*siz[y]+1ll*sx2[y]*siz[x]-2ll*sx[x]*sx[y]+1ll*sy2[x]*siz[y]+1ll*sy2[y]*siz[x]-2ll*sy[x]*sy[y];
    a.s=siz[x]*siz[y];
    //printf("%d %d:%.4lf\n",x,y,(db)a.v/a.s);
    return a;
}
bool operator <(node a,node b)
{
    if((__int128)a.v*b.s!=(__int128)b.v*a.s)return (__int128)a.v*b.s<(__int128)b.v*a.s;
    if(a.x!=b.x)return a.x<b.x;
    return a.y<b.y;
}
int main()
{
    scanf("%d",&n);
    For(i,1,n)
    {
        int x,y;
        scanf("%d%d",&x,&y);
        sx[i]=x; sx2[i]=x*x;
        sy[i]=y; sy2[i]=y*y;
        siz[i]=1;
    }
    For(i,1,n)
    {
        For(j,1,i-1)a[i][j]=make_node(i,j);
        sort(a[i]+1,a[i]+i);
        p[i]=1;
    }
    For(i,n+1,n*2-1)
    {
        node o={0,0,1,INFll};
        For(j,1,i-1)
            if(!used[j]&&p[j]<j&&a[j][p[j]]<o)o=a[j][p[j]];
        int x=o.x,y=o.y;
        used[x]=used[y]=1;
        sx[i]=sx[x]+sx[y];
        sx2[i]=sx2[x]+sx2[y];
        sy[i]=sy[x]+sy[y];
        sy2[i]=sy2[x]+sy2[y];
        siz[i]=siz[x]+siz[y];
        //printf("merge%d %d:%d\n",x,y,siz[i]);
        printf("%d\n",siz[i]);
        For(j,1,i-1)a[i][j]=make_node(i,j);
        sort(a[i]+1,a[i]+i);
        p[i]=1;
        For(j,1,i)
            if(!used[j])
                while(p[j]<j&&used[a[j][p[j]].x])p[j]++;
    }
}